./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8fb715e20e93734f29581bef128b7f826b4b5933b157899cd0cb0d668434a9d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:11:25,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:11:25,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 09:11:25,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:11:25,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:11:25,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:11:25,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:11:25,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:11:25,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 09:11:25,461 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 09:11:25,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:11:25,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:11:25,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:11:25,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:11:25,467 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:11:25,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:11:25,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:11:25,468 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:11:25,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:11:25,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:11:25,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:11:25,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:11:25,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:11:25,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:11:25,471 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:11:25,471 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:11:25,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:11:25,472 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:11:25,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:11:25,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:11:25,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 09:11:25,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:11:25,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:11:25,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:11:25,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:11:25,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:11:25,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:11:25,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:11:25,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:11:25,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:11:25,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:11:25,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:11:25,477 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b8fb715e20e93734f29581bef128b7f826b4b5933b157899cd0cb0d668434a9d [2024-10-13 09:11:25,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:11:25,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:11:25,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:11:25,756 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:11:25,757 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:11:25,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i [2024-10-13 09:11:27,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:11:27,591 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:11:27,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i [2024-10-13 09:11:27,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34ef67e9d/c1cc012a2f174871a09a2a9405cca4f7/FLAG5a10fa604 [2024-10-13 09:11:27,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34ef67e9d/c1cc012a2f174871a09a2a9405cca4f7 [2024-10-13 09:11:27,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:11:27,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:11:27,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:11:27,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:11:27,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:11:27,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:27" (1/1) ... [2024-10-13 09:11:27,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a6348b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:27, skipping insertion in model container [2024-10-13 09:11:27,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:27" (1/1) ... [2024-10-13 09:11:27,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:11:28,157 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i[33021,33034] [2024-10-13 09:11:28,293 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i[45234,45247] [2024-10-13 09:11:28,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:11:28,315 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:11:28,351 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i[33021,33034] [2024-10-13 09:11:28,428 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i[45234,45247] [2024-10-13 09:11:28,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:11:28,493 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:11:28,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:28 WrapperNode [2024-10-13 09:11:28,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:11:28,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:11:28,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:11:28,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:11:28,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:28" (1/1) ... [2024-10-13 09:11:28,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:28" (1/1) ... [2024-10-13 09:11:28,627 INFO L138 Inliner]: procedures = 177, calls = 340, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1589 [2024-10-13 09:11:28,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:11:28,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:11:28,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:11:28,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:11:28,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:28" (1/1) ... [2024-10-13 09:11:28,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:28" (1/1) ... [2024-10-13 09:11:28,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:28" (1/1) ... [2024-10-13 09:11:28,768 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 268, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-10-13 09:11:28,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:28" (1/1) ... [2024-10-13 09:11:28,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:28" (1/1) ... [2024-10-13 09:11:28,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:28" (1/1) ... [2024-10-13 09:11:28,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:28" (1/1) ... [2024-10-13 09:11:28,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:28" (1/1) ... [2024-10-13 09:11:28,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:28" (1/1) ... [2024-10-13 09:11:28,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:11:28,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:11:28,890 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:11:28,890 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:11:28,891 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:28" (1/1) ... [2024-10-13 09:11:28,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:11:28,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:11:28,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:11:28,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:11:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 09:11:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 09:11:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 09:11:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 09:11:28,980 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 09:11:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 09:11:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 09:11:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 09:11:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 09:11:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 09:11:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 09:11:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 09:11:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 09:11:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 09:11:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-10-13 09:11:28,982 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-10-13 09:11:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:11:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:11:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 09:11:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 09:11:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 09:11:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 09:11:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 09:11:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 09:11:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 09:11:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 09:11:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 09:11:28,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 09:11:28,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 09:11:28,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:11:28,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:11:29,201 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:11:29,204 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:11:30,761 INFO L? ?]: Removed 355 outVars from TransFormulas that were not future-live. [2024-10-13 09:11:30,764 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:11:30,810 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:11:30,813 INFO L314 CfgBuilder]: Removed 71 assume(true) statements. [2024-10-13 09:11:30,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:30 BoogieIcfgContainer [2024-10-13 09:11:30,814 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:11:30,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:11:30,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:11:30,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:11:30,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:11:27" (1/3) ... [2024-10-13 09:11:30,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0ddd80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:30, skipping insertion in model container [2024-10-13 09:11:30,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:28" (2/3) ... [2024-10-13 09:11:30,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0ddd80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:30, skipping insertion in model container [2024-10-13 09:11:30,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:30" (3/3) ... [2024-10-13 09:11:30,824 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test8-2.i [2024-10-13 09:11:30,840 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:11:30,841 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 09:11:30,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:11:30,928 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1e0092c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:11:30,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 09:11:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 464 states, 438 states have (on average 1.6369863013698631) internal successors, (717), 455 states have internal predecessors, (717), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 09:11:30,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 09:11:30,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:30,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:11:30,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:30,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:30,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1067961426, now seen corresponding path program 1 times [2024-10-13 09:11:30,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:30,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688117296] [2024-10-13 09:11:30,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:30,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:11:31,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:31,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688117296] [2024-10-13 09:11:31,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688117296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:31,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:11:31,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:11:31,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912863583] [2024-10-13 09:11:31,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:31,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 09:11:31,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:31,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 09:11:31,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:11:31,190 INFO L87 Difference]: Start difference. First operand has 464 states, 438 states have (on average 1.6369863013698631) internal successors, (717), 455 states have internal predecessors, (717), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:11:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:31,297 INFO L93 Difference]: Finished difference Result 927 states and 1530 transitions. [2024-10-13 09:11:31,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 09:11:31,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-13 09:11:31,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:31,317 INFO L225 Difference]: With dead ends: 927 [2024-10-13 09:11:31,317 INFO L226 Difference]: Without dead ends: 428 [2024-10-13 09:11:31,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:11:31,331 INFO L432 NwaCegarLoop]: 674 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:31,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 674 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 09:11:31,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-10-13 09:11:31,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2024-10-13 09:11:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 403 states have (on average 1.466501240694789) internal successors, (591), 419 states have internal predecessors, (591), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 09:11:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 631 transitions. [2024-10-13 09:11:31,402 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 631 transitions. Word has length 8 [2024-10-13 09:11:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:31,403 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 631 transitions. [2024-10-13 09:11:31,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:11:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2024-10-13 09:11:31,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-13 09:11:31,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:31,408 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:11:31,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:11:31,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:31,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:31,409 INFO L85 PathProgramCache]: Analyzing trace with hash 403066284, now seen corresponding path program 1 times [2024-10-13 09:11:31,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:31,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775644558] [2024-10-13 09:11:31,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:31,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:11:31,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:31,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775644558] [2024-10-13 09:11:31,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775644558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:31,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:11:31,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:11:31,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086676336] [2024-10-13 09:11:31,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:31,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:11:31,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:31,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:11:31,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:11:31,892 INFO L87 Difference]: Start difference. First operand 428 states and 631 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:11:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:32,043 INFO L93 Difference]: Finished difference Result 1039 states and 1531 transitions. [2024-10-13 09:11:32,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:11:32,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-13 09:11:32,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:32,049 INFO L225 Difference]: With dead ends: 1039 [2024-10-13 09:11:32,049 INFO L226 Difference]: Without dead ends: 812 [2024-10-13 09:11:32,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:11:32,052 INFO L432 NwaCegarLoop]: 652 mSDtfsCounter, 546 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:32,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1907 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:11:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-13 09:11:32,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 430. [2024-10-13 09:11:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 405 states have (on average 1.4641975308641975) internal successors, (593), 421 states have internal predecessors, (593), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 09:11:32,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 633 transitions. [2024-10-13 09:11:32,099 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 633 transitions. Word has length 63 [2024-10-13 09:11:32,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:32,099 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 633 transitions. [2024-10-13 09:11:32,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:11:32,100 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 633 transitions. [2024-10-13 09:11:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-13 09:11:32,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:32,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:11:32,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:11:32,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:32,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:32,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1680180753, now seen corresponding path program 1 times [2024-10-13 09:11:32,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:32,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939620029] [2024-10-13 09:11:32,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:32,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:11:32,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:32,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939620029] [2024-10-13 09:11:32,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939620029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:32,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:11:32,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:11:32,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067060483] [2024-10-13 09:11:32,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:32,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:11:32,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:32,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:11:32,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:11:32,443 INFO L87 Difference]: Start difference. First operand 430 states and 633 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:11:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:32,540 INFO L93 Difference]: Finished difference Result 860 states and 1266 transitions. [2024-10-13 09:11:32,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:11:32,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-10-13 09:11:32,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:32,544 INFO L225 Difference]: With dead ends: 860 [2024-10-13 09:11:32,544 INFO L226 Difference]: Without dead ends: 433 [2024-10-13 09:11:32,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:11:32,546 INFO L432 NwaCegarLoop]: 599 mSDtfsCounter, 105 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:32,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1706 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:11:32,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-13 09:11:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 430. [2024-10-13 09:11:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 405 states have (on average 1.4469135802469135) internal successors, (586), 421 states have internal predecessors, (586), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 09:11:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 626 transitions. [2024-10-13 09:11:32,563 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 626 transitions. Word has length 84 [2024-10-13 09:11:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:32,563 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 626 transitions. [2024-10-13 09:11:32,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:11:32,564 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 626 transitions. [2024-10-13 09:11:32,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-13 09:11:32,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:32,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:11:32,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:11:32,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:32,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:32,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1523747101, now seen corresponding path program 1 times [2024-10-13 09:11:32,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:32,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774555158] [2024-10-13 09:11:32,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:32,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:11:32,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:32,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774555158] [2024-10-13 09:11:32,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774555158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:32,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:11:32,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:11:32,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172783657] [2024-10-13 09:11:32,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:32,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:11:32,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:32,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:11:32,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:11:32,802 INFO L87 Difference]: Start difference. First operand 430 states and 626 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:11:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:32,918 INFO L93 Difference]: Finished difference Result 1151 states and 1681 transitions. [2024-10-13 09:11:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:11:32,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-10-13 09:11:32,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:32,927 INFO L225 Difference]: With dead ends: 1151 [2024-10-13 09:11:32,927 INFO L226 Difference]: Without dead ends: 724 [2024-10-13 09:11:32,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:11:32,932 INFO L432 NwaCegarLoop]: 808 mSDtfsCounter, 371 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:32,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1406 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:11:32,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-10-13 09:11:32,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 721. [2024-10-13 09:11:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 695 states have (on average 1.4561151079136692) internal successors, (1012), 711 states have internal predecessors, (1012), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 09:11:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1054 transitions. [2024-10-13 09:11:32,967 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1054 transitions. Word has length 84 [2024-10-13 09:11:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:32,968 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1054 transitions. [2024-10-13 09:11:32,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:11:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1054 transitions. [2024-10-13 09:11:32,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 09:11:32,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:32,976 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:11:32,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:11:32,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:32,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:32,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2001950907, now seen corresponding path program 1 times [2024-10-13 09:11:32,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:32,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923169322] [2024-10-13 09:11:32,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:32,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:33,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:11:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:33,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:11:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 09:11:33,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:33,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923169322] [2024-10-13 09:11:33,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923169322] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:11:33,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785931345] [2024-10-13 09:11:33,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:33,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:11:33,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:11:33,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:11:33,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 09:11:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:33,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 09:11:34,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:11:34,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 09:11:34,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-13 09:11:35,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:11:35,001 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:11:35,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785931345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:35,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:11:35,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 14 [2024-10-13 09:11:35,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304831157] [2024-10-13 09:11:35,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:35,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 09:11:35,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:35,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 09:11:35,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-13 09:11:35,005 INFO L87 Difference]: Start difference. First operand 721 states and 1054 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:37,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:37,107 INFO L93 Difference]: Finished difference Result 1690 states and 2454 transitions. [2024-10-13 09:11:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 09:11:37,108 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2024-10-13 09:11:37,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:37,113 INFO L225 Difference]: With dead ends: 1690 [2024-10-13 09:11:37,113 INFO L226 Difference]: Without dead ends: 1054 [2024-10-13 09:11:37,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-10-13 09:11:37,116 INFO L432 NwaCegarLoop]: 602 mSDtfsCounter, 816 mSDsluCounter, 2917 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 3519 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:37,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 3519 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 09:11:37,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2024-10-13 09:11:37,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 747. [2024-10-13 09:11:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 721 states have (on average 1.4466019417475728) internal successors, (1043), 737 states have internal predecessors, (1043), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 09:11:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1085 transitions. [2024-10-13 09:11:37,141 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1085 transitions. Word has length 97 [2024-10-13 09:11:37,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:37,142 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1085 transitions. [2024-10-13 09:11:37,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:37,142 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1085 transitions. [2024-10-13 09:11:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 09:11:37,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:37,144 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:11:37,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 09:11:37,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:11:37,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:37,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:37,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1928637173, now seen corresponding path program 1 times [2024-10-13 09:11:37,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:37,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49527486] [2024-10-13 09:11:37,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:37,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:37,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 09:11:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:37,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 09:11:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 09:11:37,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:37,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49527486] [2024-10-13 09:11:37,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49527486] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:11:37,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338997574] [2024-10-13 09:11:37,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:37,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:11:37,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:11:37,789 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:11:37,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 09:11:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:38,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-13 09:11:38,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:11:38,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 09:11:38,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-13 09:11:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:11:39,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:11:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338997574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:39,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:11:39,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 15 [2024-10-13 09:11:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200141975] [2024-10-13 09:11:39,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:39,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 09:11:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:39,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 09:11:39,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-13 09:11:39,260 INFO L87 Difference]: Start difference. First operand 747 states and 1085 transitions. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:44,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 09:11:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:45,376 INFO L93 Difference]: Finished difference Result 1738 states and 2518 transitions. [2024-10-13 09:11:45,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 09:11:45,377 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2024-10-13 09:11:45,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:45,382 INFO L225 Difference]: With dead ends: 1738 [2024-10-13 09:11:45,382 INFO L226 Difference]: Without dead ends: 1107 [2024-10-13 09:11:45,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2024-10-13 09:11:45,384 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 882 mSDsluCounter, 3088 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 3686 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:45,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 3686 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 943 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2024-10-13 09:11:45,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2024-10-13 09:11:45,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 783. [2024-10-13 09:11:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 757 states have (on average 1.4385733157199472) internal successors, (1089), 773 states have internal predecessors, (1089), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 09:11:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1131 transitions. [2024-10-13 09:11:45,417 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1131 transitions. Word has length 98 [2024-10-13 09:11:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:45,418 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1131 transitions. [2024-10-13 09:11:45,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1131 transitions. [2024-10-13 09:11:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 09:11:45,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:45,421 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:11:45,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 09:11:45,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 09:11:45,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:45,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:45,622 INFO L85 PathProgramCache]: Analyzing trace with hash -422667761, now seen corresponding path program 1 times [2024-10-13 09:11:45,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:45,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662794690] [2024-10-13 09:11:45,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:45,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:45,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 09:11:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:45,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 09:11:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:11:45,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:45,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662794690] [2024-10-13 09:11:45,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662794690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:45,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:11:45,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 09:11:45,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087727106] [2024-10-13 09:11:45,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:45,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 09:11:45,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:45,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 09:11:45,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 09:11:45,976 INFO L87 Difference]: Start difference. First operand 783 states and 1131 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:47,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:47,107 INFO L93 Difference]: Finished difference Result 1476 states and 2146 transitions. [2024-10-13 09:11:47,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 09:11:47,108 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2024-10-13 09:11:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:47,112 INFO L225 Difference]: With dead ends: 1476 [2024-10-13 09:11:47,112 INFO L226 Difference]: Without dead ends: 819 [2024-10-13 09:11:47,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 09:11:47,115 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 68 mSDsluCounter, 2493 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:47,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 3025 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 09:11:47,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-10-13 09:11:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 811. [2024-10-13 09:11:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 785 states have (on average 1.4394904458598725) internal successors, (1130), 801 states have internal predecessors, (1130), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 09:11:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1172 transitions. [2024-10-13 09:11:47,147 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1172 transitions. Word has length 99 [2024-10-13 09:11:47,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:47,147 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1172 transitions. [2024-10-13 09:11:47,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:47,148 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1172 transitions. [2024-10-13 09:11:47,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 09:11:47,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:47,150 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:11:47,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:11:47,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:47,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1667412822, now seen corresponding path program 1 times [2024-10-13 09:11:47,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:47,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272951580] [2024-10-13 09:11:47,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:47,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:47,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 09:11:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:47,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 09:11:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:11:47,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:47,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272951580] [2024-10-13 09:11:47,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272951580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:47,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:11:47,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:11:47,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40179963] [2024-10-13 09:11:47,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:47,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:11:47,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:47,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:11:47,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:11:47,535 INFO L87 Difference]: Start difference. First operand 811 states and 1172 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:48,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:48,531 INFO L93 Difference]: Finished difference Result 1502 states and 2183 transitions. [2024-10-13 09:11:48,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:11:48,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2024-10-13 09:11:48,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:48,536 INFO L225 Difference]: With dead ends: 1502 [2024-10-13 09:11:48,537 INFO L226 Difference]: Without dead ends: 819 [2024-10-13 09:11:48,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:11:48,540 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 63 mSDsluCounter, 2092 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:48,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 2636 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 09:11:48,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-10-13 09:11:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 817. [2024-10-13 09:11:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 791 states have (on average 1.436156763590392) internal successors, (1136), 807 states have internal predecessors, (1136), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 09:11:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1178 transitions. [2024-10-13 09:11:48,567 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1178 transitions. Word has length 99 [2024-10-13 09:11:48,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:48,567 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1178 transitions. [2024-10-13 09:11:48,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:48,567 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1178 transitions. [2024-10-13 09:11:48,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 09:11:48,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:48,569 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:11:48,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:11:48,569 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:48,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:48,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1813840567, now seen corresponding path program 1 times [2024-10-13 09:11:48,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:48,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231402188] [2024-10-13 09:11:48,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:48,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:48,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 09:11:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:49,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:11:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 09:11:49,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231402188] [2024-10-13 09:11:49,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231402188] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:11:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170207338] [2024-10-13 09:11:49,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:49,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:11:49,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:11:49,032 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:11:49,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 09:11:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:49,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 09:11:49,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:11:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:11:49,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:11:49,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170207338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:49,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:11:49,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-10-13 09:11:49,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227042243] [2024-10-13 09:11:49,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:49,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:11:49,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:49,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:11:49,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:11:49,492 INFO L87 Difference]: Start difference. First operand 817 states and 1178 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:50,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:50,074 INFO L93 Difference]: Finished difference Result 1530 states and 2217 transitions. [2024-10-13 09:11:50,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 09:11:50,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-10-13 09:11:50,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:50,078 INFO L225 Difference]: With dead ends: 1530 [2024-10-13 09:11:50,079 INFO L226 Difference]: Without dead ends: 837 [2024-10-13 09:11:50,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-13 09:11:50,081 INFO L432 NwaCegarLoop]: 602 mSDtfsCounter, 43 mSDsluCounter, 2483 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:50,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3085 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:11:50,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-13 09:11:50,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 813. [2024-10-13 09:11:50,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 787 states have (on average 1.434561626429479) internal successors, (1129), 803 states have internal predecessors, (1129), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 09:11:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1171 transitions. [2024-10-13 09:11:50,109 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1171 transitions. Word has length 100 [2024-10-13 09:11:50,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:50,110 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1171 transitions. [2024-10-13 09:11:50,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1171 transitions. [2024-10-13 09:11:50,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 09:11:50,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:50,112 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:11:50,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 09:11:50,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:11:50,317 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:50,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:50,318 INFO L85 PathProgramCache]: Analyzing trace with hash -69680462, now seen corresponding path program 1 times [2024-10-13 09:11:50,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:50,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544956616] [2024-10-13 09:11:50,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:50,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:50,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 09:11:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:50,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:11:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:50,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 09:11:50,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:50,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544956616] [2024-10-13 09:11:50,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544956616] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:11:50,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054867485] [2024-10-13 09:11:50,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:50,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:11:50,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:11:50,667 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:11:50,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 09:11:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:51,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 09:11:51,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:12:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:12:00,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:12:00,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054867485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:12:00,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:12:00,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-10-13 09:12:00,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610395905] [2024-10-13 09:12:00,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:12:00,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:12:00,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:12:00,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:12:00,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:12:00,380 INFO L87 Difference]: Start difference. First operand 813 states and 1171 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:12:03,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 09:12:06,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 09:12:06,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:12:06,824 INFO L93 Difference]: Finished difference Result 1495 states and 2164 transitions. [2024-10-13 09:12:06,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:12:06,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-10-13 09:12:06,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:12:06,828 INFO L225 Difference]: With dead ends: 1495 [2024-10-13 09:12:06,828 INFO L226 Difference]: Without dead ends: 823 [2024-10-13 09:12:06,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:12:06,830 INFO L432 NwaCegarLoop]: 606 mSDtfsCounter, 12 mSDsluCounter, 2384 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2990 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-10-13 09:12:06,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2990 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-10-13 09:12:06,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2024-10-13 09:12:06,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 813. [2024-10-13 09:12:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 787 states have (on average 1.434561626429479) internal successors, (1129), 803 states have internal predecessors, (1129), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 09:12:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1171 transitions. [2024-10-13 09:12:06,854 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1171 transitions. Word has length 100 [2024-10-13 09:12:06,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:12:06,854 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1171 transitions. [2024-10-13 09:12:06,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:12:06,854 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1171 transitions. [2024-10-13 09:12:06,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 09:12:06,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:12:06,855 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:12:06,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 09:12:07,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:12:07,057 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:12:07,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:12:07,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2036675938, now seen corresponding path program 1 times [2024-10-13 09:12:07,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:12:07,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050355554] [2024-10-13 09:12:07,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:07,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:12:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:07,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 09:12:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:07,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 09:12:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:12:07,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:12:07,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050355554] [2024-10-13 09:12:07,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050355554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:12:07,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:12:07,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 09:12:07,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239144607] [2024-10-13 09:12:07,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:12:07,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 09:12:07,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:12:07,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 09:12:07,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 09:12:07,549 INFO L87 Difference]: Start difference. First operand 813 states and 1171 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:12:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:12:08,835 INFO L93 Difference]: Finished difference Result 1519 states and 2198 transitions. [2024-10-13 09:12:08,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 09:12:08,835 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-10-13 09:12:08,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:12:08,839 INFO L225 Difference]: With dead ends: 1519 [2024-10-13 09:12:08,839 INFO L226 Difference]: Without dead ends: 847 [2024-10-13 09:12:08,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-13 09:12:08,841 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 77 mSDsluCounter, 3408 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 3948 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 09:12:08,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 3948 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 09:12:08,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-10-13 09:12:08,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 833. [2024-10-13 09:12:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 807 states have (on average 1.4287484510532837) internal successors, (1153), 823 states have internal predecessors, (1153), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 09:12:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1195 transitions. [2024-10-13 09:12:08,867 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1195 transitions. Word has length 102 [2024-10-13 09:12:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:12:08,867 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1195 transitions. [2024-10-13 09:12:08,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:12:08,868 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1195 transitions. [2024-10-13 09:12:08,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 09:12:08,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:12:08,869 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:12:08,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:12:08,869 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:12:08,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:12:08,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1608954182, now seen corresponding path program 1 times [2024-10-13 09:12:08,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:12:08,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377830540] [2024-10-13 09:12:08,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:08,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:12:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:09,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 09:12:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:09,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 09:12:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 09:12:09,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:12:09,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377830540] [2024-10-13 09:12:09,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377830540] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:12:09,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828707761] [2024-10-13 09:12:09,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:09,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:12:09,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:12:09,215 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:12:09,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 09:12:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:09,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 09:12:09,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:12:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:12:10,355 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:12:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828707761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:12:10,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:12:10,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2024-10-13 09:12:10,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707509882] [2024-10-13 09:12:10,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:12:10,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 09:12:10,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:12:10,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 09:12:10,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-10-13 09:12:10,360 INFO L87 Difference]: Start difference. First operand 833 states and 1195 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:12:12,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:12:12,395 INFO L93 Difference]: Finished difference Result 1545 states and 2227 transitions. [2024-10-13 09:12:12,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:12:12,396 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-10-13 09:12:12,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:12:12,400 INFO L225 Difference]: With dead ends: 1545 [2024-10-13 09:12:12,400 INFO L226 Difference]: Without dead ends: 863 [2024-10-13 09:12:12,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-10-13 09:12:12,402 INFO L432 NwaCegarLoop]: 607 mSDtfsCounter, 17 mSDsluCounter, 3882 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4489 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:12:12,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4489 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 09:12:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-10-13 09:12:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 857. [2024-10-13 09:12:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 831 states have (on average 1.4235860409145609) internal successors, (1183), 847 states have internal predecessors, (1183), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 09:12:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1225 transitions. [2024-10-13 09:12:12,424 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1225 transitions. Word has length 102 [2024-10-13 09:12:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:12:12,425 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1225 transitions. [2024-10-13 09:12:12,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:12:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1225 transitions. [2024-10-13 09:12:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 09:12:12,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:12:12,426 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:12:12,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 09:12:12,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 09:12:12,627 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:12:12,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:12:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1280845619, now seen corresponding path program 1 times [2024-10-13 09:12:12,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:12:12,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521992300] [2024-10-13 09:12:12,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:12,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:12:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:12,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 09:12:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:12,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 09:12:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 09:12:12,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:12:12,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521992300] [2024-10-13 09:12:12,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521992300] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:12:12,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246864728] [2024-10-13 09:12:12,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:12,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:12:12,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:12:12,930 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:12:12,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 09:12:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:13,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 09:12:13,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:12:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:12:13,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:12:13,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246864728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:12:13,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:12:13,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-10-13 09:12:13,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123643643] [2024-10-13 09:12:13,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:12:13,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:12:13,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:12:13,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:12:13,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:12:13,584 INFO L87 Difference]: Start difference. First operand 857 states and 1225 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:12:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:12:14,140 INFO L93 Difference]: Finished difference Result 1561 states and 2245 transitions. [2024-10-13 09:12:14,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:12:14,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-10-13 09:12:14,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:12:14,145 INFO L225 Difference]: With dead ends: 1561 [2024-10-13 09:12:14,145 INFO L226 Difference]: Without dead ends: 867 [2024-10-13 09:12:14,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:12:14,149 INFO L432 NwaCegarLoop]: 606 mSDtfsCounter, 10 mSDsluCounter, 2384 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2990 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:12:14,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2990 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:12:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-10-13 09:12:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 857. [2024-10-13 09:12:14,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 831 states have (on average 1.4235860409145609) internal successors, (1183), 847 states have internal predecessors, (1183), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 09:12:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1225 transitions. [2024-10-13 09:12:14,175 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1225 transitions. Word has length 102 [2024-10-13 09:12:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:12:14,176 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1225 transitions. [2024-10-13 09:12:14,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:12:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1225 transitions. [2024-10-13 09:12:14,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 09:12:14,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:12:14,178 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:12:14,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 09:12:14,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:12:14,379 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:12:14,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:12:14,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1764824217, now seen corresponding path program 1 times [2024-10-13 09:12:14,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:12:14,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202973342] [2024-10-13 09:12:14,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:14,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:12:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:14,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:12:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:14,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 09:12:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 09:12:14,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:12:14,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202973342] [2024-10-13 09:12:14,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202973342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:12:14,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381721756] [2024-10-13 09:12:14,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:14,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:12:14,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:12:14,730 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:12:14,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 09:12:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:15,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 09:12:15,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:12:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:12:15,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:12:15,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381721756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:12:15,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:12:15,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-13 09:12:15,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380265110] [2024-10-13 09:12:15,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:12:15,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:12:15,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:12:15,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:12:15,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:12:15,321 INFO L87 Difference]: Start difference. First operand 857 states and 1225 transitions. Second operand has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 09:12:15,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:12:15,358 INFO L93 Difference]: Finished difference Result 1516 states and 2179 transitions. [2024-10-13 09:12:15,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:12:15,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-10-13 09:12:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:12:15,363 INFO L225 Difference]: With dead ends: 1516 [2024-10-13 09:12:15,363 INFO L226 Difference]: Without dead ends: 859 [2024-10-13 09:12:15,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:12:15,365 INFO L432 NwaCegarLoop]: 618 mSDtfsCounter, 0 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:12:15,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1850 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 09:12:15,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-10-13 09:12:15,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2024-10-13 09:12:15,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 832 states have (on average 1.4242788461538463) internal successors, (1185), 849 states have internal predecessors, (1185), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 09:12:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1228 transitions. [2024-10-13 09:12:15,388 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1228 transitions. Word has length 103 [2024-10-13 09:12:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:12:15,389 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1228 transitions. [2024-10-13 09:12:15,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 09:12:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1228 transitions. [2024-10-13 09:12:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 09:12:15,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:12:15,390 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:12:15,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 09:12:15,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:12:15,591 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:12:15,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:12:15,592 INFO L85 PathProgramCache]: Analyzing trace with hash 166828079, now seen corresponding path program 1 times [2024-10-13 09:12:15,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:12:15,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338182337] [2024-10-13 09:12:15,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:15,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:12:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:16,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:12:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:16,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 09:12:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 09:12:16,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:12:16,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338182337] [2024-10-13 09:12:16,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338182337] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:12:16,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904204872] [2024-10-13 09:12:16,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:16,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:12:16,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:12:16,096 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:12:16,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 09:12:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:16,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-10-13 09:12:16,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:12:16,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 09:12:16,682 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-10-13 09:12:16,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2024-10-13 09:12:16,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 09:12:16,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 09:12:16,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-13 09:12:16,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-13 09:12:16,930 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 09:12:16,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-13 09:12:16,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-13 09:12:28,701 INFO L224 Elim1Store]: Index analysis took 449 ms