./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd --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 64bit --witnessprinter.graph.data.programhash 5d0330b863a3199999a1d87752dfb6e311192d268b0239668c112b8f01744457 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:24:01,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:24:01,721 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-13 16:24:01,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:24:01,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:24:01,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:24:01,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:24:01,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:24:01,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:24:01,772 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:24:01,772 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:24:01,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:24:01,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:24:01,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:24:01,776 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:24:01,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:24:01,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:24:01,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:24:01,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:24:01,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:24:01,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:24:01,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:24:01,777 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:24:01,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:24:01,778 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:24:01,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:24:01,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:24:01,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:24:01,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:24:01,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:24:01,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:24:01,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:24:01,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:24:01,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:24:01,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:24:01,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:24:01,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:24:01,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:24:01,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:24:01,779 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5d0330b863a3199999a1d87752dfb6e311192d268b0239668c112b8f01744457 [2024-11-13 16:24:02,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:24:02,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:24:02,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:24:02,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:24:02,169 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:24:02,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i Unable to find full path for "g++" [2024-11-13 16:24:04,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:24:04,674 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:24:04,675 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i [2024-11-13 16:24:04,708 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/data/56b735842/4c7b9672bb0c41249b9409bb57745c8c/FLAGf6175f8b1 [2024-11-13 16:24:04,723 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/data/56b735842/4c7b9672bb0c41249b9409bb57745c8c [2024-11-13 16:24:04,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:24:04,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:24:04,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:24:04,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:24:04,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:24:04,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:24:04" (1/1) ... [2024-11-13 16:24:04,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30fab353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:04, skipping insertion in model container [2024-11-13 16:24:04,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:24:04" (1/1) ... [2024-11-13 16:24:04,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:24:05,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4496,4509] [2024-11-13 16:24:05,156 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4556,4569] [2024-11-13 16:24:06,139 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:06,140 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:06,141 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:06,142 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:06,143 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:06,159 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:06,160 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:06,163 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:06,163 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:06,166 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:06,167 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:06,168 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:06,169 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:06,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[150690,150703] [2024-11-13 16:24:06,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:24:06,899 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:24:06,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4496,4509] [2024-11-13 16:24:06,919 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4556,4569] [2024-11-13 16:24:07,002 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:07,003 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:07,005 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:07,005 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:07,006 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:07,021 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:07,025 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:07,026 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:07,027 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:07,028 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:07,029 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:07,029 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:07,030 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 16:24:07,154 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[150690,150703] [2024-11-13 16:24:07,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:24:07,313 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:24:07,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:07 WrapperNode [2024-11-13 16:24:07,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:24:07,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:24:07,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:24:07,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:24:07,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:07" (1/1) ... [2024-11-13 16:24:07,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:07" (1/1) ... [2024-11-13 16:24:07,403 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 141 [2024-11-13 16:24:07,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:24:07,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:24:07,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:24:07,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:24:07,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:07" (1/1) ... [2024-11-13 16:24:07,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:07" (1/1) ... [2024-11-13 16:24:07,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:07" (1/1) ... [2024-11-13 16:24:07,452 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 17, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 6 writes are split as follows [0, 6, 0]. [2024-11-13 16:24:07,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:07" (1/1) ... [2024-11-13 16:24:07,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:07" (1/1) ... [2024-11-13 16:24:07,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:07" (1/1) ... [2024-11-13 16:24:07,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:07" (1/1) ... [2024-11-13 16:24:07,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:07" (1/1) ... [2024-11-13 16:24:07,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:07" (1/1) ... [2024-11-13 16:24:07,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:24:07,499 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:24:07,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:24:07,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:24:07,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:07" (1/1) ... [2024-11-13 16:24:07,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:24:07,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:24:07,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:24:07,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:24:07,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 16:24:07,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 16:24:07,575 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 16:24:07,575 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-13 16:24:07,575 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-13 16:24:07,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 16:24:07,575 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-13 16:24:07,575 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-13 16:24:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:24:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 16:24:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 16:24:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 16:24:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:24:07,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:24:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 16:24:07,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 16:24:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 16:24:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 16:24:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 16:24:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 16:24:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 16:24:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 16:24:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 16:24:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-13 16:24:07,579 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-13 16:24:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:24:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 16:24:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 16:24:07,864 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:24:07,867 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:24:08,133 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-13 16:24:08,133 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:24:08,143 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:24:08,144 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 16:24:08,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:24:08 BoogieIcfgContainer [2024-11-13 16:24:08,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:24:08,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:24:08,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:24:08,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:24:08,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:24:04" (1/3) ... [2024-11-13 16:24:08,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708596d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:24:08, skipping insertion in model container [2024-11-13 16:24:08,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:24:07" (2/3) ... [2024-11-13 16:24:08,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708596d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:24:08, skipping insertion in model container [2024-11-13 16:24:08,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:24:08" (3/3) ... [2024-11-13 16:24:08,156 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness_negated.i [2024-11-13 16:24:08,181 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:24:08,183 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_rbegin_harness_negated.i that has 6 procedures, 68 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-13 16:24:08,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:24:08,261 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;@4336f58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:24:08,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:24:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 16:24:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 16:24:08,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:24:08,275 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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-11-13 16:24:08,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:24:08,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1799453489, now seen corresponding path program 1 times [2024-11-13 16:24:08,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:08,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915336820] [2024-11-13 16:24:08,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:08,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:08,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:24:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:08,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:24:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:08,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:24:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:08,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 16:24:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:08,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 16:24:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:08,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 16:24:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:08,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 16:24:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 16:24:09,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:09,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915336820] [2024-11-13 16:24:09,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915336820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:09,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:24:09,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:24:09,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673424191] [2024-11-13 16:24:09,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:09,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:24:09,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:09,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:24:09,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:24:09,046 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 16:24:09,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:24:09,077 INFO L93 Difference]: Finished difference Result 128 states and 184 transitions. [2024-11-13 16:24:09,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:24:09,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-11-13 16:24:09,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:24:09,088 INFO L225 Difference]: With dead ends: 128 [2024-11-13 16:24:09,089 INFO L226 Difference]: Without dead ends: 63 [2024-11-13 16:24:09,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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-11-13 16:24:09,100 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:24:09,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:24:09,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-13 16:24:09,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-13 16:24:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 16:24:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2024-11-13 16:24:09,141 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 68 [2024-11-13 16:24:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:24:09,142 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2024-11-13 16:24:09,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 16:24:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2024-11-13 16:24:09,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 16:24:09,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:24:09,145 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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-11-13 16:24:09,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:24:09,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:24:09,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:09,146 INFO L85 PathProgramCache]: Analyzing trace with hash 513145519, now seen corresponding path program 1 times [2024-11-13 16:24:09,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:09,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420087910] [2024-11-13 16:24:09,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:09,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:09,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:24:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:09,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:24:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:09,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:24:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:10,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 16:24:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:10,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 16:24:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:10,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 16:24:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:10,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 16:24:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 16:24:10,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:10,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420087910] [2024-11-13 16:24:10,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420087910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:24:10,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46232860] [2024-11-13 16:24:10,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:10,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:24:10,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:24:10,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:24:10,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:24:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:10,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-13 16:24:10,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:24:10,729 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 18 treesize of output 7 [2024-11-13 16:24:10,748 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 14 treesize of output 15 [2024-11-13 16:24:10,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:24:10,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:24:10,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:24:10,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2024-11-13 16:24:10,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:24:10,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:24:10,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 11 [2024-11-13 16:24:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 16:24:11,811 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:24:11,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46232860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:11,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:24:11,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2024-11-13 16:24:11,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583371577] [2024-11-13 16:24:11,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:11,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 16:24:11,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:11,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 16:24:11,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:24:11,814 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 16:24:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:24:12,553 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2024-11-13 16:24:12,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 16:24:12,554 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2024-11-13 16:24:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:24:12,558 INFO L225 Difference]: With dead ends: 172 [2024-11-13 16:24:12,559 INFO L226 Difference]: Without dead ends: 122 [2024-11-13 16:24:12,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-13 16:24:12,560 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 49 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:24:12,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 368 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 16:24:12,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-13 16:24:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2024-11-13 16:24:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 86 states have internal predecessors, (110), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2024-11-13 16:24:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 158 transitions. [2024-11-13 16:24:12,587 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 158 transitions. Word has length 68 [2024-11-13 16:24:12,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:24:12,587 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 158 transitions. [2024-11-13 16:24:12,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 16:24:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 158 transitions. [2024-11-13 16:24:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 16:24:12,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:24:12,590 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 16:24:12,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 16:24:12,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:24:12,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:24:12,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:12,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1536242323, now seen corresponding path program 1 times [2024-11-13 16:24:12,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:24:12,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392121293] [2024-11-13 16:24:12,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:12,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:24:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:13,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:24:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:13,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:24:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:13,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:24:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:13,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 16:24:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:13,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 16:24:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:13,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 16:24:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:13,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 16:24:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 16:24:13,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:24:13,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392121293] [2024-11-13 16:24:13,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392121293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:24:13,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088335709] [2024-11-13 16:24:13,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:24:13,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:24:13,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:24:13,439 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:24:13,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 16:24:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:24:13,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-13 16:24:13,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:24:13,854 INFO L349 Elim1Store]: treesize reduction 42, result has 31.1 percent of original size [2024-11-13 16:24:13,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 80 [2024-11-13 16:24:13,870 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 16 treesize of output 15 [2024-11-13 16:24:13,899 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:24:13,900 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 16 treesize of output 1 [2024-11-13 16:24:13,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 22 [2024-11-13 16:24:29,345 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-13 16:24:29,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 71 [2024-11-13 16:24:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 16:24:29,371 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:24:29,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088335709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:24:29,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:24:29,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2024-11-13 16:24:29,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041481474] [2024-11-13 16:24:29,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:24:29,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 16:24:29,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:24:29,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 16:24:29,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=173, Unknown=2, NotChecked=0, Total=210 [2024-11-13 16:24:29,376 INFO L87 Difference]: Start difference. First operand 118 states and 158 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 16:24:33,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:24:41,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:24:45,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:24:47,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:24:51,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:24:58,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:25:02,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:25:06,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:25:08,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:08,814 INFO L93 Difference]: Finished difference Result 189 states and 262 transitions. [2024-11-13 16:25:08,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 16:25:08,815 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2024-11-13 16:25:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:25:08,817 INFO L225 Difference]: With dead ends: 189 [2024-11-13 16:25:08,818 INFO L226 Difference]: Without dead ends: 136 [2024-11-13 16:25:08,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=97, Invalid=451, Unknown=4, NotChecked=0, Total=552 [2024-11-13 16:25:08,820 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 201 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 54 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:25:08,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 423 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 31.4s Time] [2024-11-13 16:25:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-13 16:25:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2024-11-13 16:25:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 92 states have (on average 1.358695652173913) internal successors, (125), 95 states have internal predecessors, (125), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-13 16:25:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 175 transitions. [2024-11-13 16:25:08,850 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 175 transitions. Word has length 68 [2024-11-13 16:25:08,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:25:08,851 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 175 transitions. [2024-11-13 16:25:08,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 16:25:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 175 transitions. [2024-11-13 16:25:08,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 16:25:08,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:25:08,857 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 16:25:08,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 16:25:09,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:25:09,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:25:09,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:09,058 INFO L85 PathProgramCache]: Analyzing trace with hash 392030379, now seen corresponding path program 1 times [2024-11-13 16:25:09,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:09,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094398974] [2024-11-13 16:25:09,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:09,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:09,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:25:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:09,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:25:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:09,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:25:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:09,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 16:25:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:09,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 16:25:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:09,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 16:25:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:09,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 16:25:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 16:25:09,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:09,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094398974] [2024-11-13 16:25:09,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094398974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:09,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:09,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:25:09,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149961852] [2024-11-13 16:25:09,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:09,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:25:09,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:09,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:25:09,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:25:09,540 INFO L87 Difference]: Start difference. First operand 128 states and 175 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-13 16:25:09,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:09,614 INFO L93 Difference]: Finished difference Result 148 states and 203 transitions. [2024-11-13 16:25:09,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:25:09,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2024-11-13 16:25:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:25:09,617 INFO L225 Difference]: With dead ends: 148 [2024-11-13 16:25:09,617 INFO L226 Difference]: Without dead ends: 146 [2024-11-13 16:25:09,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:25:09,618 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 3 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:25:09,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 387 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:25:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-13 16:25:09,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2024-11-13 16:25:09,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 101 states have (on average 1.3267326732673268) internal successors, (134), 107 states have internal predecessors, (134), 27 states have call successors, (27), 11 states have call predecessors, (27), 15 states have return successors, (37), 25 states have call predecessors, (37), 25 states have call successors, (37) [2024-11-13 16:25:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 198 transitions. [2024-11-13 16:25:09,665 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 198 transitions. Word has length 68 [2024-11-13 16:25:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:25:09,665 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 198 transitions. [2024-11-13 16:25:09,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-13 16:25:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 198 transitions. [2024-11-13 16:25:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-13 16:25:09,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:25:09,668 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 16:25:09,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 16:25:09,668 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:25:09,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:09,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1683977017, now seen corresponding path program 1 times [2024-11-13 16:25:09,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:09,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920890165] [2024-11-13 16:25:09,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:09,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:25:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:09,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:25:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:09,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:25:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:09,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 16:25:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:09,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 16:25:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:09,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 16:25:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:10,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 16:25:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 16:25:10,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:10,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920890165] [2024-11-13 16:25:10,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920890165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:10,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:10,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 16:25:10,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786279132] [2024-11-13 16:25:10,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:10,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:25:10,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:10,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:25:10,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:25:10,166 INFO L87 Difference]: Start difference. First operand 144 states and 198 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 16:25:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:10,286 INFO L93 Difference]: Finished difference Result 304 states and 436 transitions. [2024-11-13 16:25:10,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:25:10,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2024-11-13 16:25:10,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:25:10,290 INFO L225 Difference]: With dead ends: 304 [2024-11-13 16:25:10,290 INFO L226 Difference]: Without dead ends: 177 [2024-11-13 16:25:10,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:25:10,292 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 25 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:25:10,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 315 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:25:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-13 16:25:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 165. [2024-11-13 16:25:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 122 states have (on average 1.360655737704918) internal successors, (166), 128 states have internal predecessors, (166), 27 states have call successors, (27), 11 states have call predecessors, (27), 15 states have return successors, (37), 25 states have call predecessors, (37), 25 states have call successors, (37) [2024-11-13 16:25:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 230 transitions. [2024-11-13 16:25:10,343 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 230 transitions. Word has length 70 [2024-11-13 16:25:10,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:25:10,343 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 230 transitions. [2024-11-13 16:25:10,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 16:25:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 230 transitions. [2024-11-13 16:25:10,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-13 16:25:10,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:25:10,346 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2024-11-13 16:25:10,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 16:25:10,346 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:25:10,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:10,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1589921925, now seen corresponding path program 1 times [2024-11-13 16:25:10,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:10,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051796572] [2024-11-13 16:25:10,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:10,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:10,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:25:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:10,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:25:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:10,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:25:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:10,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 16:25:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:10,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 16:25:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:10,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 16:25:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:10,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 16:25:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 16:25:10,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:10,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051796572] [2024-11-13 16:25:10,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051796572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:10,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:10,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:25:10,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073562458] [2024-11-13 16:25:10,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:10,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:25:10,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:10,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:25:10,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:25:10,650 INFO L87 Difference]: Start difference. First operand 165 states and 230 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 16:25:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:10,739 INFO L93 Difference]: Finished difference Result 315 states and 458 transitions. [2024-11-13 16:25:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:25:10,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2024-11-13 16:25:10,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:25:10,743 INFO L225 Difference]: With dead ends: 315 [2024-11-13 16:25:10,744 INFO L226 Difference]: Without dead ends: 167 [2024-11-13 16:25:10,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:25:10,747 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:25:10,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 354 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:25:10,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-13 16:25:10,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2024-11-13 16:25:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 128 states have internal predecessors, (164), 27 states have call successors, (27), 11 states have call predecessors, (27), 15 states have return successors, (37), 25 states have call predecessors, (37), 25 states have call successors, (37) [2024-11-13 16:25:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 228 transitions. [2024-11-13 16:25:10,805 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 228 transitions. Word has length 70 [2024-11-13 16:25:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:25:10,805 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 228 transitions. [2024-11-13 16:25:10,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 16:25:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 228 transitions. [2024-11-13 16:25:10,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-13 16:25:10,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:25:10,807 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-11-13 16:25:10,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 16:25:10,807 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:25:10,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:10,808 INFO L85 PathProgramCache]: Analyzing trace with hash 578804675, now seen corresponding path program 1 times [2024-11-13 16:25:10,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:10,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775069564] [2024-11-13 16:25:10,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:10,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:25:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:25:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:25:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 16:25:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 16:25:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 16:25:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 16:25:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 16:25:11,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:11,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775069564] [2024-11-13 16:25:11,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775069564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:11,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:11,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:25:11,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157724626] [2024-11-13 16:25:11,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:11,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:25:11,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:11,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:25:11,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:25:11,171 INFO L87 Difference]: Start difference. First operand 165 states and 228 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 16:25:11,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:11,264 INFO L93 Difference]: Finished difference Result 314 states and 448 transitions. [2024-11-13 16:25:11,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:25:11,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2024-11-13 16:25:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:25:11,268 INFO L225 Difference]: With dead ends: 314 [2024-11-13 16:25:11,269 INFO L226 Difference]: Without dead ends: 166 [2024-11-13 16:25:11,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:25:11,273 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:25:11,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 354 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:25:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-13 16:25:11,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2024-11-13 16:25:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 128 states have internal predecessors, (159), 27 states have call successors, (27), 11 states have call predecessors, (27), 15 states have return successors, (37), 25 states have call predecessors, (37), 25 states have call successors, (37) [2024-11-13 16:25:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 223 transitions. [2024-11-13 16:25:11,310 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 223 transitions. Word has length 70 [2024-11-13 16:25:11,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:25:11,310 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 223 transitions. [2024-11-13 16:25:11,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 16:25:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 223 transitions. [2024-11-13 16:25:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-13 16:25:11,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:25:11,312 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-11-13 16:25:11,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 16:25:11,312 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:25:11,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:11,315 INFO L85 PathProgramCache]: Analyzing trace with hash 836970113, now seen corresponding path program 2 times [2024-11-13 16:25:11,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:11,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547770400] [2024-11-13 16:25:11,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:11,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:25:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:25:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:25:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 16:25:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 16:25:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 16:25:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 16:25:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 16:25:11,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:11,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547770400] [2024-11-13 16:25:11,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547770400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:11,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:11,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:25:11,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478743717] [2024-11-13 16:25:11,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:11,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:25:11,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:11,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:25:11,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:25:11,585 INFO L87 Difference]: Start difference. First operand 165 states and 223 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 16:25:11,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:11,658 INFO L93 Difference]: Finished difference Result 304 states and 423 transitions. [2024-11-13 16:25:11,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:25:11,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2024-11-13 16:25:11,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:25:11,661 INFO L225 Difference]: With dead ends: 304 [2024-11-13 16:25:11,661 INFO L226 Difference]: Without dead ends: 156 [2024-11-13 16:25:11,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:25:11,662 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 7 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:25:11,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 350 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:25:11,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-13 16:25:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2024-11-13 16:25:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 110 states have internal predecessors, (129), 26 states have call successors, (26), 11 states have call predecessors, (26), 14 states have return successors, (34), 24 states have call predecessors, (34), 24 states have call successors, (34) [2024-11-13 16:25:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2024-11-13 16:25:11,691 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 70 [2024-11-13 16:25:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:25:11,692 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2024-11-13 16:25:11,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 16:25:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2024-11-13 16:25:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 16:25:11,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:25:11,694 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 16:25:11,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 16:25:11,694 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:25:11,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:11,695 INFO L85 PathProgramCache]: Analyzing trace with hash 445649396, now seen corresponding path program 1 times [2024-11-13 16:25:11,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:11,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863724063] [2024-11-13 16:25:11,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:11,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:25:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:25:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:25:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 16:25:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 16:25:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 16:25:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 16:25:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 16:25:11,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:11,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863724063] [2024-11-13 16:25:11,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863724063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:11,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:11,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:25:11,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674225681] [2024-11-13 16:25:11,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:11,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:25:11,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:11,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:25:11,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:25:11,974 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 16:25:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:12,049 INFO L93 Difference]: Finished difference Result 279 states and 368 transitions. [2024-11-13 16:25:12,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:25:12,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2024-11-13 16:25:12,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:25:12,051 INFO L225 Difference]: With dead ends: 279 [2024-11-13 16:25:12,053 INFO L226 Difference]: Without dead ends: 150 [2024-11-13 16:25:12,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:25:12,055 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 10 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:25:12,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 265 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:25:12,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-13 16:25:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2024-11-13 16:25:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 112 states have internal predecessors, (131), 26 states have call successors, (26), 11 states have call predecessors, (26), 14 states have return successors, (34), 24 states have call predecessors, (34), 24 states have call successors, (34) [2024-11-13 16:25:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2024-11-13 16:25:12,081 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 72 [2024-11-13 16:25:12,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:25:12,081 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2024-11-13 16:25:12,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 16:25:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2024-11-13 16:25:12,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 16:25:12,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:25:12,082 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 16:25:12,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 16:25:12,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:25:12,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:12,083 INFO L85 PathProgramCache]: Analyzing trace with hash 302738925, now seen corresponding path program 1 times [2024-11-13 16:25:12,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:12,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637990465] [2024-11-13 16:25:12,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:12,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:12,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:25:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:12,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:25:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:12,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:25:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:12,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 16:25:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:12,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 16:25:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:12,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 16:25:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:12,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 16:25:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:12,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 16:25:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 16:25:12,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:12,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637990465] [2024-11-13 16:25:12,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637990465] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:25:12,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043226462] [2024-11-13 16:25:12,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:12,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:25:12,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:25:12,466 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:25:12,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 16:25:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:12,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-13 16:25:12,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:25:12,726 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 24 treesize of output 9 [2024-11-13 16:25:12,739 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 18 treesize of output 19 [2024-11-13 16:25:12,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:12,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:12,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:12,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2024-11-13 16:25:12,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:12,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:12,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 13 [2024-11-13 16:25:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 16:25:14,199 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:25:14,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043226462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:14,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:25:14,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2024-11-13 16:25:14,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003218847] [2024-11-13 16:25:14,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:14,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 16:25:14,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:14,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 16:25:14,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 16:25:14,200 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-13 16:25:15,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:15,017 INFO L93 Difference]: Finished difference Result 217 states and 274 transitions. [2024-11-13 16:25:15,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 16:25:15,017 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 74 [2024-11-13 16:25:15,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:25:15,019 INFO L225 Difference]: With dead ends: 217 [2024-11-13 16:25:15,019 INFO L226 Difference]: Without dead ends: 150 [2024-11-13 16:25:15,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 74 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-13 16:25:15,021 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 43 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:25:15,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 425 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 16:25:15,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-13 16:25:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2024-11-13 16:25:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 112 states have internal predecessors, (130), 26 states have call successors, (26), 11 states have call predecessors, (26), 14 states have return successors, (34), 24 states have call predecessors, (34), 24 states have call successors, (34) [2024-11-13 16:25:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 190 transitions. [2024-11-13 16:25:15,049 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 190 transitions. Word has length 74 [2024-11-13 16:25:15,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:25:15,050 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 190 transitions. [2024-11-13 16:25:15,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-13 16:25:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 190 transitions. [2024-11-13 16:25:15,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 16:25:15,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:25:15,055 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 16:25:15,076 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 16:25:15,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 16:25:15,260 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:25:15,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:15,260 INFO L85 PathProgramCache]: Analyzing trace with hash 88615934, now seen corresponding path program 1 times [2024-11-13 16:25:15,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:15,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750849242] [2024-11-13 16:25:15,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:15,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:25:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:25:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:25:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 16:25:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 16:25:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 16:25:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 16:25:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 16:25:15,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:15,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750849242] [2024-11-13 16:25:15,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750849242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:15,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:15,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:25:15,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806380915] [2024-11-13 16:25:15,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:15,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:25:15,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:15,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:25:15,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:25:15,540 INFO L87 Difference]: Start difference. First operand 148 states and 190 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 16:25:15,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:15,613 INFO L93 Difference]: Finished difference Result 287 states and 378 transitions. [2024-11-13 16:25:15,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:25:15,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2024-11-13 16:25:15,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:25:15,615 INFO L225 Difference]: With dead ends: 287 [2024-11-13 16:25:15,615 INFO L226 Difference]: Without dead ends: 156 [2024-11-13 16:25:15,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:25:15,616 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 9 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:25:15,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 267 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:25:15,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-13 16:25:15,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2024-11-13 16:25:15,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 114 states have internal predecessors, (132), 26 states have call successors, (26), 11 states have call predecessors, (26), 14 states have return successors, (34), 24 states have call predecessors, (34), 24 states have call successors, (34) [2024-11-13 16:25:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 192 transitions. [2024-11-13 16:25:15,644 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 192 transitions. Word has length 73 [2024-11-13 16:25:15,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:25:15,644 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 192 transitions. [2024-11-13 16:25:15,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 16:25:15,645 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 192 transitions. [2024-11-13 16:25:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 16:25:15,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:25:15,648 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 16:25:15,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 16:25:15,649 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:25:15,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:15,649 INFO L85 PathProgramCache]: Analyzing trace with hash -433618711, now seen corresponding path program 1 times [2024-11-13 16:25:15,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:15,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109824645] [2024-11-13 16:25:15,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:15,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:25:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:25:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:25:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 16:25:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 16:25:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 16:25:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 16:25:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 16:25:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 16:25:15,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:15,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109824645] [2024-11-13 16:25:15,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109824645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:25:15,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655917450] [2024-11-13 16:25:15,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:15,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:25:15,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:25:15,995 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:25:15,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 16:25:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:16,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 16:25:16,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:25:16,267 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 24 treesize of output 9 [2024-11-13 16:25:16,277 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 18 treesize of output 19 [2024-11-13 16:25:16,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:16,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:16,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 13 [2024-11-13 16:25:16,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:16,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:16,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:16,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2024-11-13 16:25:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 16:25:16,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:25:16,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655917450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:16,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:25:16,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2024-11-13 16:25:16,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744854295] [2024-11-13 16:25:16,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:16,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 16:25:16,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:16,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 16:25:16,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 16:25:16,957 INFO L87 Difference]: Start difference. First operand 150 states and 192 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-13 16:25:17,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:17,923 INFO L93 Difference]: Finished difference Result 226 states and 287 transitions. [2024-11-13 16:25:17,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 16:25:17,924 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2024-11-13 16:25:17,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:25:17,925 INFO L225 Difference]: With dead ends: 226 [2024-11-13 16:25:17,925 INFO L226 Difference]: Without dead ends: 157 [2024-11-13 16:25:17,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-13 16:25:17,928 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 62 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:25:17,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 445 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 16:25:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-13 16:25:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2024-11-13 16:25:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 116 states have internal predecessors, (134), 26 states have call successors, (26), 11 states have call predecessors, (26), 14 states have return successors, (34), 24 states have call predecessors, (34), 24 states have call successors, (34) [2024-11-13 16:25:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 194 transitions. [2024-11-13 16:25:17,956 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 194 transitions. Word has length 74 [2024-11-13 16:25:17,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:25:17,956 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 194 transitions. [2024-11-13 16:25:17,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-13 16:25:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 194 transitions. [2024-11-13 16:25:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 16:25:17,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:25:17,958 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 16:25:17,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 16:25:18,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 16:25:18,160 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:25:18,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:18,160 INFO L85 PathProgramCache]: Analyzing trace with hash 442400295, now seen corresponding path program 1 times [2024-11-13 16:25:18,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:18,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538503876] [2024-11-13 16:25:18,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:18,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:18,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:25:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:18,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:25:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:18,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:25:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:18,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 16:25:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:18,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 16:25:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:18,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 16:25:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:18,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 16:25:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:18,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 16:25:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 16:25:18,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:18,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538503876] [2024-11-13 16:25:18,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538503876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:25:18,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902436629] [2024-11-13 16:25:18,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:18,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:25:18,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:25:18,766 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:25:18,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 16:25:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:18,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-13 16:25:18,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:25:19,045 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 13 treesize of output 1 [2024-11-13 16:25:19,048 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 13 treesize of output 1 [2024-11-13 16:25:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 16:25:19,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:25:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 16:25:20,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902436629] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:25:20,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:25:20,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 12] total 30 [2024-11-13 16:25:20,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329562109] [2024-11-13 16:25:20,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:25:20,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 16:25:20,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:20,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 16:25:20,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2024-11-13 16:25:20,416 INFO L87 Difference]: Start difference. First operand 152 states and 194 transitions. Second operand has 30 states, 28 states have (on average 3.7857142857142856) internal successors, (106), 28 states have internal predecessors, (106), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 6 states have call predecessors, (21), 10 states have call successors, (21) [2024-11-13 16:25:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:21,648 INFO L93 Difference]: Finished difference Result 349 states and 450 transitions. [2024-11-13 16:25:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 16:25:21,649 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.7857142857142856) internal successors, (106), 28 states have internal predecessors, (106), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 6 states have call predecessors, (21), 10 states have call successors, (21) Word has length 74 [2024-11-13 16:25:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:25:21,651 INFO L225 Difference]: With dead ends: 349 [2024-11-13 16:25:21,651 INFO L226 Difference]: Without dead ends: 214 [2024-11-13 16:25:21,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=243, Invalid=1649, Unknown=0, NotChecked=0, Total=1892 [2024-11-13 16:25:21,653 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 149 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 16:25:21,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 747 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 16:25:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-13 16:25:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 201. [2024-11-13 16:25:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 157 states have internal predecessors, (180), 30 states have call successors, (30), 15 states have call predecessors, (30), 17 states have return successors, (42), 28 states have call predecessors, (42), 28 states have call successors, (42) [2024-11-13 16:25:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 252 transitions. [2024-11-13 16:25:21,702 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 252 transitions. Word has length 74 [2024-11-13 16:25:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:25:21,703 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 252 transitions. [2024-11-13 16:25:21,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.7857142857142856) internal successors, (106), 28 states have internal predecessors, (106), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 6 states have call predecessors, (21), 10 states have call successors, (21) [2024-11-13 16:25:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 252 transitions. [2024-11-13 16:25:21,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 16:25:21,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:25:21,705 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2024-11-13 16:25:21,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 16:25:21,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 16:25:21,910 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:25:21,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:21,910 INFO L85 PathProgramCache]: Analyzing trace with hash 483075045, now seen corresponding path program 1 times [2024-11-13 16:25:21,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:21,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171103498] [2024-11-13 16:25:21,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:21,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:22,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:25:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:22,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:25:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:22,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:25:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:22,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 16:25:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:22,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 16:25:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:22,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 16:25:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:22,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 16:25:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:22,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 16:25:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 16:25:22,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:22,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171103498] [2024-11-13 16:25:22,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171103498] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:25:22,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902239812] [2024-11-13 16:25:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:22,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:25:22,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:25:22,174 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:25:22,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 16:25:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:22,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 16:25:22,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:25:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 16:25:22,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:25:22,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902239812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:22,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:25:22,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-11-13 16:25:22,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014060393] [2024-11-13 16:25:22,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:22,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:25:22,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:22,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:25:22,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:25:22,487 INFO L87 Difference]: Start difference. First operand 201 states and 252 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-13 16:25:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:22,648 INFO L93 Difference]: Finished difference Result 413 states and 510 transitions. [2024-11-13 16:25:22,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:25:22,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2024-11-13 16:25:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:25:22,651 INFO L225 Difference]: With dead ends: 413 [2024-11-13 16:25:22,653 INFO L226 Difference]: Without dead ends: 211 [2024-11-13 16:25:22,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:25:22,654 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 76 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:25:22,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 248 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:25:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-13 16:25:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2024-11-13 16:25:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 157 states have (on average 1.1592356687898089) internal successors, (182), 162 states have internal predecessors, (182), 30 states have call successors, (30), 15 states have call predecessors, (30), 18 states have return successors, (42), 28 states have call predecessors, (42), 28 states have call successors, (42) [2024-11-13 16:25:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 254 transitions. [2024-11-13 16:25:22,688 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 254 transitions. Word has length 74 [2024-11-13 16:25:22,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:25:22,689 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 254 transitions. [2024-11-13 16:25:22,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-13 16:25:22,689 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 254 transitions. [2024-11-13 16:25:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 16:25:22,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:25:22,690 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 16:25:22,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 16:25:22,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 16:25:22,895 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:25:22,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:22,895 INFO L85 PathProgramCache]: Analyzing trace with hash 683978781, now seen corresponding path program 1 times [2024-11-13 16:25:22,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:22,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389132200] [2024-11-13 16:25:22,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:22,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:23,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:25:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:23,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:25:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:23,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:25:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:23,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:25:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:23,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:25:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:23,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:25:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:23,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:25:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:23,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:25:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 16:25:23,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389132200] [2024-11-13 16:25:23,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389132200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:25:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827013519] [2024-11-13 16:25:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:23,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:25:23,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:25:23,258 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:25:23,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 16:25:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:23,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-13 16:25:23,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:25:23,576 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 18 treesize of output 19 [2024-11-13 16:25:23,587 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 24 treesize of output 9 [2024-11-13 16:25:23,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:23,656 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 16:25:23,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:23,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:23,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-13 16:25:23,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:23,677 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 25 treesize of output 18 [2024-11-13 16:25:23,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:23,685 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 34 treesize of output 25 [2024-11-13 16:25:23,848 INFO L349 Elim1Store]: treesize reduction 50, result has 18.0 percent of original size [2024-11-13 16:25:23,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 148 [2024-11-13 16:25:23,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:23,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:23,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 100 [2024-11-13 16:25:23,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:23,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:23,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:23,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:23,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 44 [2024-11-13 16:25:23,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:23,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 24 [2024-11-13 16:25:26,134 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 16:25:26,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:25:26,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:25:26,868 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-13 16:25:30,902 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| 1)) (forall ((v_arrayElimArr_7 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| v_arrayElimArr_7))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 0))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| 1)) (forall ((v_ArrVal_792 Int) (v_ArrVal_791 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| v_ArrVal_791))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_792))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2024-11-13 16:25:30,917 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:25:30,918 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:25:30,993 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-11-13 16:25:30,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 171 treesize of output 200 [2024-11-13 16:25:31,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:25:31,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 234 [2024-11-13 16:25:31,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 201 treesize of output 189 [2024-11-13 16:25:31,049 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:25:31,050 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:25:31,130 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-11-13 16:25:31,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 261 treesize of output 290 [2024-11-13 16:25:31,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:25:31,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 328 treesize of output 324 [2024-11-13 16:25:31,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 269 treesize of output 257 [2024-11-13 16:25:31,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2024-11-13 16:25:31,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2024-11-13 16:25:32,118 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:25:32,119 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:25:32,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:25:32,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 177 [2024-11-13 16:25:32,336 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:25:32,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:25:32,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 152 [2024-11-13 16:25:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2024-11-13 16:25:32,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827013519] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:25:32,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:25:32,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 23 [2024-11-13 16:25:32,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206147603] [2024-11-13 16:25:32,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:25:32,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 16:25:32,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:32,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 16:25:32,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=389, Unknown=14, NotChecked=40, Total=506 [2024-11-13 16:25:32,553 INFO L87 Difference]: Start difference. First operand 206 states and 254 transitions. Second operand has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2024-11-13 16:25:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:35,508 INFO L93 Difference]: Finished difference Result 450 states and 563 transitions. [2024-11-13 16:25:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 16:25:35,509 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 75 [2024-11-13 16:25:35,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:25:35,511 INFO L225 Difference]: With dead ends: 450 [2024-11-13 16:25:35,511 INFO L226 Difference]: Without dead ends: 260 [2024-11-13 16:25:35,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 141 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=160, Invalid=1084, Unknown=20, NotChecked=68, Total=1332 [2024-11-13 16:25:35,515 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 86 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 45 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:25:35,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1086 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 668 Invalid, 2 Unknown, 144 Unchecked, 2.1s Time] [2024-11-13 16:25:35,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-13 16:25:35,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 237. [2024-11-13 16:25:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 177 states have (on average 1.1864406779661016) internal successors, (210), 182 states have internal predecessors, (210), 38 states have call successors, (38), 19 states have call predecessors, (38), 21 states have return successors, (44), 35 states have call predecessors, (44), 35 states have call successors, (44) [2024-11-13 16:25:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 292 transitions. [2024-11-13 16:25:35,561 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 292 transitions. Word has length 75 [2024-11-13 16:25:35,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:25:35,561 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 292 transitions. [2024-11-13 16:25:35,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2024-11-13 16:25:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 292 transitions. [2024-11-13 16:25:35,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 16:25:35,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:25:35,565 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 16:25:35,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 16:25:35,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 16:25:35,770 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:25:35,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:35,770 INFO L85 PathProgramCache]: Analyzing trace with hash -422005866, now seen corresponding path program 1 times [2024-11-13 16:25:35,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:35,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975417995] [2024-11-13 16:25:35,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:35,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:36,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:25:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:36,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:25:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:36,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:25:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:36,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:25:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:36,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:25:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:36,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:25:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:36,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 16:25:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:36,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 16:25:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:36,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 16:25:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 16:25:36,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:36,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975417995] [2024-11-13 16:25:36,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975417995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:25:36,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137366727] [2024-11-13 16:25:36,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:36,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:25:36,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:25:36,143 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:25:36,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 16:25:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:36,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 16:25:36,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:25:36,528 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2024-11-13 16:25:36,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2024-11-13 16:25:36,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2024-11-13 16:25:36,556 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:25:36,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 1 [2024-11-13 16:25:36,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 34 [2024-11-13 16:25:36,669 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_32| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_30| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_32|) .cse1))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_4) .cse0)) (= .cse0 (select v_DerPreprocessor_4 .cse1)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_32| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_32|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_30| 24)))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_32| .cse2)) (not (= .cse2 0)))))) is different from true [2024-11-13 16:25:36,980 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_31| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_33| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_33|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_31| 24)))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_33| .cse0)) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_31| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_33| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_31| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_33|) .cse2))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (select v_DerPreprocessor_4 .cse2)) (= (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_4) .cse1) v_DerPreprocessor_3))) (not (= .cse1 0))))))) is different from true [2024-11-13 16:25:37,219 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_13|) .cse1))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (select v_DerPreprocessor_4 .cse1)) (= (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse0) v_DerPreprocessor_3))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_13| 24)))) (and (not (= .cse2 0)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_13|)))))) is different from true [2024-11-13 16:25:37,721 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_14| 24)))) (and (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_14|)) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_14|) .cse2))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_4) .cse1) v_DerPreprocessor_3) (= .cse1 (select v_DerPreprocessor_4 .cse2)))) (not (= .cse1 0))))))) is different from true [2024-11-13 16:25:37,902 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)))) (and (not (= .cse0 0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_15|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_15|) .cse2))) (and (not (= .cse1 0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (select v_DerPreprocessor_4 .cse2)) (= (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_15| v_DerPreprocessor_4) .cse1) v_DerPreprocessor_3)))))))) is different from true [2024-11-13 16:25:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 37 not checked. [2024-11-13 16:25:38,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:25:38,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:25:38,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 245 [2024-11-13 16:25:38,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 172 treesize of output 156 [2024-11-13 16:25:39,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2024-11-13 16:25:39,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 [2024-11-13 16:25:39,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2024-11-13 16:25:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 16:25:39,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137366727] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:25:39,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:25:39,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6, 15] total 25 [2024-11-13 16:25:39,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380796238] [2024-11-13 16:25:39,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:39,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 16:25:39,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:39,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 16:25:39,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=326, Unknown=10, NotChecked=200, Total=600 [2024-11-13 16:25:39,098 INFO L87 Difference]: Start difference. First operand 237 states and 292 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-13 16:25:39,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:39,616 INFO L93 Difference]: Finished difference Result 394 states and 484 transitions. [2024-11-13 16:25:39,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 16:25:39,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 88 [2024-11-13 16:25:39,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:25:39,620 INFO L225 Difference]: With dead ends: 394 [2024-11-13 16:25:39,621 INFO L226 Difference]: Without dead ends: 240 [2024-11-13 16:25:39,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 169 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=432, Unknown=12, NotChecked=230, Total=756 [2024-11-13 16:25:39,622 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:25:39,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 455 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 16:25:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-13 16:25:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2024-11-13 16:25:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 177 states have (on average 1.1751412429378532) internal successors, (208), 182 states have internal predecessors, (208), 38 states have call successors, (38), 19 states have call predecessors, (38), 21 states have return successors, (44), 35 states have call predecessors, (44), 35 states have call successors, (44) [2024-11-13 16:25:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 290 transitions. [2024-11-13 16:25:39,675 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 290 transitions. Word has length 88 [2024-11-13 16:25:39,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:25:39,675 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 290 transitions. [2024-11-13 16:25:39,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-13 16:25:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 290 transitions. [2024-11-13 16:25:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 16:25:39,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:25:39,677 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2024-11-13 16:25:39,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 16:25:39,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 16:25:39,878 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:25:39,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:39,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1165713238, now seen corresponding path program 1 times [2024-11-13 16:25:39,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:39,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831649211] [2024-11-13 16:25:39,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:39,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:25:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:40,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:25:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:40,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:25:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:40,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:25:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:40,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:25:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:40,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:25:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:40,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 16:25:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:40,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 16:25:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:40,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 16:25:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 16:25:40,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:40,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831649211] [2024-11-13 16:25:40,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831649211] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:25:40,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641856039] [2024-11-13 16:25:40,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:40,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:25:40,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:25:40,273 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:25:40,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 16:25:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:40,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-13 16:25:40,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:25:40,643 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 24 treesize of output 9 [2024-11-13 16:25:40,660 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 18 treesize of output 19 [2024-11-13 16:25:40,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:40,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:40,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-13 16:25:40,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:40,717 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 16:25:40,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:40,724 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 25 treesize of output 18 [2024-11-13 16:25:40,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:40,730 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 34 treesize of output 25 [2024-11-13 16:25:40,846 INFO L349 Elim1Store]: treesize reduction 50, result has 18.0 percent of original size [2024-11-13 16:25:40,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 178 treesize of output 178 [2024-11-13 16:25:40,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:40,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:40,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 130 [2024-11-13 16:25:40,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:40,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:40,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:40,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:25:40,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 35 [2024-11-13 16:25:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 16:25:42,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:25:43,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:25:43,459 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-13 16:26:03,657 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:26:03,658 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:26:03,741 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2024-11-13 16:26:03,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 297 treesize of output 284 [2024-11-13 16:26:03,751 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:26:03,752 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:26:03,831 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2024-11-13 16:26:03,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 229 treesize of output 258 [2024-11-13 16:26:03,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:26:03,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 286 treesize of output 268 [2024-11-13 16:26:03,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:26:03,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 320 treesize of output 316 [2024-11-13 16:26:03,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 269 treesize of output 257 [2024-11-13 16:26:03,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 281 treesize of output 269 [2024-11-13 16:26:03,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2024-11-13 16:26:03,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2024-11-13 16:26:04,854 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:26:04,855 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:26:04,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:26:04,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 132 [2024-11-13 16:26:04,994 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:26:05,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:26:05,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 59 [2024-11-13 16:26:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 16:26:05,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641856039] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:26:05,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:26:05,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 23 [2024-11-13 16:26:05,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627301734] [2024-11-13 16:26:05,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:26:05,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 16:26:05,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:05,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 16:26:05,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=405, Unknown=39, NotChecked=0, Total=506 [2024-11-13 16:26:05,140 INFO L87 Difference]: Start difference. First operand 237 states and 290 transitions. Second operand has 23 states, 22 states have (on average 5.181818181818182) internal successors, (114), 21 states have internal predecessors, (114), 7 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-13 16:26:10,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:26:19,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:26:27,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:26:31,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:26:35,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:26:38,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:26:38,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:38,812 INFO L93 Difference]: Finished difference Result 422 states and 508 transitions. [2024-11-13 16:26:38,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 16:26:38,813 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.181818181818182) internal successors, (114), 21 states have internal predecessors, (114), 7 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) Word has length 88 [2024-11-13 16:26:38,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:38,815 INFO L225 Difference]: With dead ends: 422 [2024-11-13 16:26:38,815 INFO L226 Difference]: Without dead ends: 269 [2024-11-13 16:26:38,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=165, Invalid=970, Unknown=55, NotChecked=0, Total=1190 [2024-11-13 16:26:38,817 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 60 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 7 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:26:38,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1074 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 740 Invalid, 30 Unknown, 0 Unchecked, 23.5s Time] [2024-11-13 16:26:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-13 16:26:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 254. [2024-11-13 16:26:38,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 193 states have (on average 1.1865284974093264) internal successors, (229), 196 states have internal predecessors, (229), 39 states have call successors, (39), 21 states have call predecessors, (39), 21 states have return successors, (39), 36 states have call predecessors, (39), 36 states have call successors, (39) [2024-11-13 16:26:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 307 transitions. [2024-11-13 16:26:38,861 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 307 transitions. Word has length 88 [2024-11-13 16:26:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:38,861 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 307 transitions. [2024-11-13 16:26:38,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.181818181818182) internal successors, (114), 21 states have internal predecessors, (114), 7 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-13 16:26:38,862 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 307 transitions. [2024-11-13 16:26:38,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 16:26:38,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:38,863 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 16:26:38,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 16:26:39,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 16:26:39,068 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:26:39,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:39,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1451939903, now seen corresponding path program 1 times [2024-11-13 16:26:39,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:39,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684639101] [2024-11-13 16:26:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:39,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:39,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:26:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:39,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:26:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:39,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:26:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:39,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:26:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:39,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:26:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:39,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:26:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:39,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:26:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:39,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 16:26:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:39,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 16:26:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:39,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 16:26:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 16:26:39,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:39,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684639101] [2024-11-13 16:26:39,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684639101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:26:39,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424804243] [2024-11-13 16:26:39,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:39,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:26:39,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:26:39,617 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:26:39,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 16:26:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:39,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-13 16:26:39,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:26:40,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-13 16:26:40,047 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 14 treesize of output 15 [2024-11-13 16:26:41,161 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 16:26:41,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:26:41,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424804243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:41,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:26:41,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [7] total 19 [2024-11-13 16:26:41,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648490276] [2024-11-13 16:26:41,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:41,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 16:26:41,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:41,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 16:26:41,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2024-11-13 16:26:41,163 INFO L87 Difference]: Start difference. First operand 254 states and 307 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-13 16:26:42,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:42,630 INFO L93 Difference]: Finished difference Result 338 states and 411 transitions. [2024-11-13 16:26:42,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 16:26:42,632 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 100 [2024-11-13 16:26:42,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:42,634 INFO L225 Difference]: With dead ends: 338 [2024-11-13 16:26:42,634 INFO L226 Difference]: Without dead ends: 268 [2024-11-13 16:26:42,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2024-11-13 16:26:42,635 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 48 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:26:42,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 864 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 16:26:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-13 16:26:42,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 262. [2024-11-13 16:26:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 198 states have (on average 1.1868686868686869) internal successors, (235), 203 states have internal predecessors, (235), 40 states have call successors, (40), 21 states have call predecessors, (40), 23 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2024-11-13 16:26:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 319 transitions. [2024-11-13 16:26:42,681 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 319 transitions. Word has length 100 [2024-11-13 16:26:42,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:42,682 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 319 transitions. [2024-11-13 16:26:42,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-13 16:26:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 319 transitions. [2024-11-13 16:26:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 16:26:42,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:42,684 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 16:26:42,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 16:26:42,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 16:26:42,884 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:26:42,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:42,885 INFO L85 PathProgramCache]: Analyzing trace with hash -158580609, now seen corresponding path program 1 times [2024-11-13 16:26:42,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:42,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321229417] [2024-11-13 16:26:42,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:42,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:43,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:26:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:43,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:26:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:43,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:26:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:43,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:26:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:43,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:26:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:43,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:26:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:43,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:26:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:43,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 16:26:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:43,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 16:26:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:43,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 16:26:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 16:26:43,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:43,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321229417] [2024-11-13 16:26:43,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321229417] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:26:43,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494958642] [2024-11-13 16:26:43,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:43,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:26:43,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:26:43,658 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:26:43,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 16:26:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:43,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-13 16:26:43,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:26:44,101 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 26 treesize of output 1 [2024-11-13 16:26:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 16:26:44,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:26:44,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494958642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:44,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:26:44,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2024-11-13 16:26:44,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722742378] [2024-11-13 16:26:44,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:44,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 16:26:44,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:44,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 16:26:44,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2024-11-13 16:26:44,995 INFO L87 Difference]: Start difference. First operand 262 states and 319 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-13 16:26:49,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:26:53,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:26:57,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:27:01,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:27:05,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:27:06,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:06,654 INFO L93 Difference]: Finished difference Result 363 states and 450 transitions. [2024-11-13 16:27:06,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 16:27:06,655 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 100 [2024-11-13 16:27:06,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:06,657 INFO L225 Difference]: With dead ends: 363 [2024-11-13 16:27:06,657 INFO L226 Difference]: Without dead ends: 285 [2024-11-13 16:27:06,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=167, Invalid=1239, Unknown=0, NotChecked=0, Total=1406 [2024-11-13 16:27:06,658 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 190 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 36 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:06,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 613 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 519 Invalid, 5 Unknown, 0 Unchecked, 21.2s Time] [2024-11-13 16:27:06,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-13 16:27:06,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 272. [2024-11-13 16:27:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 206 states have (on average 1.1990291262135921) internal successors, (247), 212 states have internal predecessors, (247), 41 states have call successors, (41), 21 states have call predecessors, (41), 24 states have return successors, (49), 38 states have call predecessors, (49), 38 states have call successors, (49) [2024-11-13 16:27:06,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 337 transitions. [2024-11-13 16:27:06,708 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 337 transitions. Word has length 100 [2024-11-13 16:27:06,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:06,708 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 337 transitions. [2024-11-13 16:27:06,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-13 16:27:06,708 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 337 transitions. [2024-11-13 16:27:06,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 16:27:06,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:06,710 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 16:27:06,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-13 16:27:06,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:27:06,910 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:06,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:06,911 INFO L85 PathProgramCache]: Analyzing trace with hash -651206783, now seen corresponding path program 1 times [2024-11-13 16:27:06,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:06,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976741611] [2024-11-13 16:27:06,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:06,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:07,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:27:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:07,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:27:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:07,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:27:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:07,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:27:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:07,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:27:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:07,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:27:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:07,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:27:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:07,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 16:27:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:07,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 16:27:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:07,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 16:27:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-13 16:27:07,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:07,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976741611] [2024-11-13 16:27:07,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976741611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:27:07,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503518142] [2024-11-13 16:27:07,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:07,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:27:07,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:27:07,294 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:27:07,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 16:27:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:07,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 16:27:07,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:27:07,814 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 16:27:07,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:27:07,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503518142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:07,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:27:07,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2024-11-13 16:27:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436634251] [2024-11-13 16:27:07,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:07,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 16:27:07,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:07,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 16:27:07,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 16:27:07,816 INFO L87 Difference]: Start difference. First operand 272 states and 337 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-13 16:27:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:08,355 INFO L93 Difference]: Finished difference Result 587 states and 757 transitions. [2024-11-13 16:27:08,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 16:27:08,356 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 100 [2024-11-13 16:27:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:08,358 INFO L225 Difference]: With dead ends: 587 [2024-11-13 16:27:08,359 INFO L226 Difference]: Without dead ends: 351 [2024-11-13 16:27:08,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2024-11-13 16:27:08,360 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 110 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:08,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 447 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:27:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-13 16:27:08,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 303. [2024-11-13 16:27:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 228 states have (on average 1.219298245614035) internal successors, (278), 241 states have internal predecessors, (278), 46 states have call successors, (46), 21 states have call predecessors, (46), 28 states have return successors, (62), 40 states have call predecessors, (62), 43 states have call successors, (62) [2024-11-13 16:27:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 386 transitions. [2024-11-13 16:27:08,409 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 386 transitions. Word has length 100 [2024-11-13 16:27:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:08,409 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 386 transitions. [2024-11-13 16:27:08,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-13 16:27:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 386 transitions. [2024-11-13 16:27:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 16:27:08,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:08,411 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 16:27:08,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 16:27:08,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:27:08,612 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:08,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:08,612 INFO L85 PathProgramCache]: Analyzing trace with hash 287239344, now seen corresponding path program 1 times [2024-11-13 16:27:08,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:08,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645895216] [2024-11-13 16:27:08,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:08,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:08,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:27:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:08,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:27:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:08,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:27:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:09,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:27:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:09,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:27:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:09,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:27:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:09,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:27:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:09,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:27:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:09,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:27:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:09,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:27:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:09,208 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 16:27:09,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:09,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645895216] [2024-11-13 16:27:09,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645895216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:27:09,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822830538] [2024-11-13 16:27:09,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:09,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:27:09,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:27:09,211 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:27:09,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 16:27:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:09,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-13 16:27:09,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:27:09,586 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 8 treesize of output 1 [2024-11-13 16:27:09,588 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 8 treesize of output 1 [2024-11-13 16:27:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 28 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:27:10,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:27:11,426 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 16:27:11,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822830538] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:27:11,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:27:11,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 13] total 32 [2024-11-13 16:27:11,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553555097] [2024-11-13 16:27:11,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:27:11,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-13 16:27:11,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:11,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 16:27:11,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2024-11-13 16:27:11,429 INFO L87 Difference]: Start difference. First operand 303 states and 386 transitions. Second operand has 32 states, 32 states have (on average 4.59375) internal successors, (147), 30 states have internal predecessors, (147), 12 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (26), 11 states have call predecessors, (26), 12 states have call successors, (26) [2024-11-13 16:27:12,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:12,302 INFO L93 Difference]: Finished difference Result 639 states and 850 transitions. [2024-11-13 16:27:12,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 16:27:12,303 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.59375) internal successors, (147), 30 states have internal predecessors, (147), 12 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (26), 11 states have call predecessors, (26), 12 states have call successors, (26) Word has length 102 [2024-11-13 16:27:12,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:12,305 INFO L225 Difference]: With dead ends: 639 [2024-11-13 16:27:12,305 INFO L226 Difference]: Without dead ends: 386 [2024-11-13 16:27:12,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 200 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=176, Invalid=1306, Unknown=0, NotChecked=0, Total=1482 [2024-11-13 16:27:12,307 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 161 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:12,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 920 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 16:27:12,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-13 16:27:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 316. [2024-11-13 16:27:12,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 241 states have (on average 1.2323651452282158) internal successors, (297), 248 states have internal predecessors, (297), 46 states have call successors, (46), 21 states have call predecessors, (46), 28 states have return successors, (62), 46 states have call predecessors, (62), 43 states have call successors, (62) [2024-11-13 16:27:12,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 405 transitions. [2024-11-13 16:27:12,370 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 405 transitions. Word has length 102 [2024-11-13 16:27:12,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:12,370 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 405 transitions. [2024-11-13 16:27:12,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.59375) internal successors, (147), 30 states have internal predecessors, (147), 12 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (26), 11 states have call predecessors, (26), 12 states have call successors, (26) [2024-11-13 16:27:12,371 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 405 transitions. [2024-11-13 16:27:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 16:27:12,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:12,373 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 16:27:12,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 16:27:12,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:27:12,577 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:12,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:12,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2110762309, now seen corresponding path program 1 times [2024-11-13 16:27:12,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:12,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174886993] [2024-11-13 16:27:12,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:12,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:12,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:27:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:12,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:27:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:12,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 16:27:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:12,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:27:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:12,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:27:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:12,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:27:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:12,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:27:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:12,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:27:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:12,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:27:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:12,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:27:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-13 16:27:12,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:12,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174886993] [2024-11-13 16:27:12,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174886993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:27:12,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210066005] [2024-11-13 16:27:12,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:12,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:27:12,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:27:12,821 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:27:12,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 16:27:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:13,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 16:27:13,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:27:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 16:27:13,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:27:13,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210066005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:13,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:27:13,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-13 16:27:13,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858636925] [2024-11-13 16:27:13,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:13,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:27:13,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:13,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:27:13,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:27:13,173 INFO L87 Difference]: Start difference. First operand 316 states and 405 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-13 16:27:13,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:13,256 INFO L93 Difference]: Finished difference Result 599 states and 796 transitions. [2024-11-13 16:27:13,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:27:13,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 102 [2024-11-13 16:27:13,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:13,260 INFO L225 Difference]: With dead ends: 599 [2024-11-13 16:27:13,260 INFO L226 Difference]: Without dead ends: 319 [2024-11-13 16:27:13,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:27:13,264 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:13,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:27:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-13 16:27:13,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2024-11-13 16:27:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 241 states have (on average 1.2157676348547717) internal successors, (293), 248 states have internal predecessors, (293), 46 states have call successors, (46), 21 states have call predecessors, (46), 28 states have return successors, (62), 46 states have call predecessors, (62), 43 states have call successors, (62) [2024-11-13 16:27:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 401 transitions. [2024-11-13 16:27:13,324 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 401 transitions. Word has length 102 [2024-11-13 16:27:13,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:13,325 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 401 transitions. [2024-11-13 16:27:13,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-13 16:27:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 401 transitions. [2024-11-13 16:27:13,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 16:27:13,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:13,327 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 16:27:13,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 16:27:13,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:27:13,527 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:13,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:13,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1081403011, now seen corresponding path program 2 times [2024-11-13 16:27:13,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:13,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233857695] [2024-11-13 16:27:13,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:13,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:13,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:27:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:13,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:27:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:13,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 16:27:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:13,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:27:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:13,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:27:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:13,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:27:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:14,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:27:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:14,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:27:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:14,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:27:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:14,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:27:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-13 16:27:14,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:14,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233857695] [2024-11-13 16:27:14,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233857695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:27:14,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232389331] [2024-11-13 16:27:14,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:27:14,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:27:14,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:27:14,076 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:27:14,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 16:27:14,435 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:27:14,435 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:27:14,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-13 16:27:14,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:27:14,523 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 14 treesize of output 15 [2024-11-13 16:27:14,543 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 18 treesize of output 7 [2024-11-13 16:27:14,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:27:14,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:27:14,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-11-13 16:27:14,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:27:14,628 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-13 16:27:14,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:27:14,637 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 23 treesize of output 16 [2024-11-13 16:27:14,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:27:14,645 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 21 [2024-11-13 16:27:14,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:27:14,770 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-11-13 16:27:14,770 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 46 [2024-11-13 16:27:14,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:27:14,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:27:14,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2024-11-13 16:27:14,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:27:14,828 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 32 treesize of output 23 [2024-11-13 16:27:14,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:27:14,837 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 21 [2024-11-13 16:27:15,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:27:15,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:27:15,037 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 108 treesize of output 97 [2024-11-13 16:27:15,080 INFO L349 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2024-11-13 16:27:15,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 99 [2024-11-13 16:27:15,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:27:15,132 INFO L349 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2024-11-13 16:27:15,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 133 treesize of output 90 [2024-11-13 16:27:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 16:27:19,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:27:20,010 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1570 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1569))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_1570))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_1571 Int)) (= 0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_1571)))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2))))) is different from false [2024-11-13 16:27:20,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:27:20,043 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 70 [2024-11-13 16:27:20,085 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_36| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_36| 1)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_1563 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1563) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_36| v_arrayElimArr_21))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_36| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_36| 1)) (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1570 Int) (v_ArrVal_1566 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1566) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_36| v_ArrVal_1569))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_1570))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2024-11-13 16:27:20,157 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_37| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_37| 1)) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_36| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_36| 1)) (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1570 Int) (v_ArrVal_1566 (Array Int Int))) (= (select (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_37|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_37| v_ArrVal_1566) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_36| v_ArrVal_1569))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_1570))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_37| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_37| 1)) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_36| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_36| 1)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_1563 (Array Int Int)) (v_subst_3 Int)) (= (select (select (let ((.cse3 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_37| v_ArrVal_1563) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_36| v_arrayElimArr_21))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))))))) is different from false [2024-11-13 16:27:20,177 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:27:20,178 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:27:20,289 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2024-11-13 16:27:20,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1109 treesize of output 868 [2024-11-13 16:27:20,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:27:20,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1046 treesize of output 960 [2024-11-13 16:27:20,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 567 treesize of output 547 [2024-11-13 16:27:20,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 643 treesize of output 603 [2024-11-13 16:27:20,367 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:27:20,368 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:27:20,461 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2024-11-13 16:27:20,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1067 treesize of output 982 [2024-11-13 16:27:20,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:27:20,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1038 treesize of output 1030 [2024-11-13 16:27:20,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1055 treesize of output 1015 [2024-11-13 16:27:20,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1063 treesize of output 1043 [2024-11-13 16:27:20,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2024-11-13 16:27:23,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2024-11-13 16:27:23,644 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:27:23,645 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:27:23,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:27:23,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 132 [2024-11-13 16:27:23,728 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:27:23,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:27:23,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 59 [2024-11-13 16:27:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 3 not checked. [2024-11-13 16:27:23,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232389331] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:27:23,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:27:23,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 12] total 28 [2024-11-13 16:27:23,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459332775] [2024-11-13 16:27:23,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:27:23,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 16:27:23,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:23,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 16:27:23,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=525, Unknown=3, NotChecked=144, Total=756 [2024-11-13 16:27:23,867 INFO L87 Difference]: Start difference. First operand 316 states and 401 transitions. Second operand has 28 states, 27 states have (on average 4.37037037037037) internal successors, (118), 27 states have internal predecessors, (118), 10 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) [2024-11-13 16:27:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:26,938 INFO L93 Difference]: Finished difference Result 597 states and 757 transitions. [2024-11-13 16:27:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 16:27:26,939 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.37037037037037) internal successors, (118), 27 states have internal predecessors, (118), 10 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) Word has length 102 [2024-11-13 16:27:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:26,942 INFO L225 Difference]: With dead ends: 597 [2024-11-13 16:27:26,942 INFO L226 Difference]: Without dead ends: 343 [2024-11-13 16:27:26,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 197 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=241, Invalid=1748, Unknown=3, NotChecked=264, Total=2256 [2024-11-13 16:27:26,944 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 74 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 470 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:26,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1383 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 947 Invalid, 0 Unknown, 470 Unchecked, 1.6s Time] [2024-11-13 16:27:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-13 16:27:27,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 338. [2024-11-13 16:27:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 256 states have (on average 1.19140625) internal successors, (305), 269 states have internal predecessors, (305), 46 states have call successors, (46), 22 states have call predecessors, (46), 35 states have return successors, (73), 46 states have call predecessors, (73), 43 states have call successors, (73) [2024-11-13 16:27:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 424 transitions. [2024-11-13 16:27:27,047 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 424 transitions. Word has length 102 [2024-11-13 16:27:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:27,047 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 424 transitions. [2024-11-13 16:27:27,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.37037037037037) internal successors, (118), 27 states have internal predecessors, (118), 10 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) [2024-11-13 16:27:27,048 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 424 transitions. [2024-11-13 16:27:27,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 16:27:27,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:27,050 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 16:27:27,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 16:27:27,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:27:27,250 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:27,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:27,250 INFO L85 PathProgramCache]: Analyzing trace with hash -379014106, now seen corresponding path program 1 times [2024-11-13 16:27:27,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:27,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507495259] [2024-11-13 16:27:27,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:27,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:27,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:27:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:27,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:27:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:27,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 16:27:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:27,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:27:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:27,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:27:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:27,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:27:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:27,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:27:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:27,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:27:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:27:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:28,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 16:27:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 16:27:28,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:28,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507495259] [2024-11-13 16:27:28,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507495259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:27:28,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138466265] [2024-11-13 16:27:28,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:28,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:27:28,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:27:28,101 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:27:28,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 16:27:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:28,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-13 16:27:28,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:27:28,577 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 13 treesize of output 1 [2024-11-13 16:27:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 39 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 16:27:29,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:27:29,974 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 243 treesize of output 227 [2024-11-13 16:27:29,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 51 treesize of output 47 [2024-11-13 16:27:29,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 53 treesize of output 45 [2024-11-13 16:27:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 16:27:30,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138466265] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:27:30,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:27:30,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 37 [2024-11-13 16:27:30,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611405244] [2024-11-13 16:27:30,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:27:30,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-13 16:27:30,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:30,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-13 16:27:30,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2024-11-13 16:27:30,094 INFO L87 Difference]: Start difference. First operand 338 states and 424 transitions. Second operand has 37 states, 35 states have (on average 3.942857142857143) internal successors, (138), 37 states have internal predecessors, (138), 14 states have call successors, (25), 3 states have call predecessors, (25), 9 states have return successors, (25), 12 states have call predecessors, (25), 14 states have call successors, (25) [2024-11-13 16:27:34,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:27:38,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:27:42,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:27:44,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:44,911 INFO L93 Difference]: Finished difference Result 1208 states and 1567 transitions. [2024-11-13 16:27:44,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 16:27:44,912 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 3.942857142857143) internal successors, (138), 37 states have internal predecessors, (138), 14 states have call successors, (25), 3 states have call predecessors, (25), 9 states have return successors, (25), 12 states have call predecessors, (25), 14 states have call successors, (25) Word has length 105 [2024-11-13 16:27:44,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:44,917 INFO L225 Difference]: With dead ends: 1208 [2024-11-13 16:27:44,917 INFO L226 Difference]: Without dead ends: 978 [2024-11-13 16:27:44,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 214 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=425, Invalid=3115, Unknown=0, NotChecked=0, Total=3540 [2024-11-13 16:27:44,920 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 300 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 87 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:44,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1980 Invalid, 1941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1851 Invalid, 3 Unknown, 0 Unchecked, 13.8s Time] [2024-11-13 16:27:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-13 16:27:45,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 657. [2024-11-13 16:27:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 504 states have (on average 1.2103174603174602) internal successors, (610), 534 states have internal predecessors, (610), 82 states have call successors, (82), 36 states have call predecessors, (82), 70 states have return successors, (165), 86 states have call predecessors, (165), 77 states have call successors, (165) [2024-11-13 16:27:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 857 transitions. [2024-11-13 16:27:45,095 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 857 transitions. Word has length 105 [2024-11-13 16:27:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:45,095 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 857 transitions. [2024-11-13 16:27:45,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 3.942857142857143) internal successors, (138), 37 states have internal predecessors, (138), 14 states have call successors, (25), 3 states have call predecessors, (25), 9 states have return successors, (25), 12 states have call predecessors, (25), 14 states have call successors, (25) [2024-11-13 16:27:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 857 transitions. [2024-11-13 16:27:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 16:27:45,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:45,099 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 16:27:45,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-13 16:27:45,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:27:45,299 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:45,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:45,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1676584296, now seen corresponding path program 1 times [2024-11-13 16:27:45,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:45,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065109608] [2024-11-13 16:27:45,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:45,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:45,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:27:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:45,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:27:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:45,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 16:27:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:45,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:27:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:45,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:27:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:45,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:27:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:45,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:27:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:27:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:45,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:27:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:45,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 16:27:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:27:45,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:45,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065109608] [2024-11-13 16:27:45,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065109608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:27:45,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431921775] [2024-11-13 16:27:45,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:45,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:27:45,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:27:45,711 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:27:45,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 16:27:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:46,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 16:27:46,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:27:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 16:27:46,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:27:46,707 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:27:46,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431921775] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:27:46,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:27:46,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 22 [2024-11-13 16:27:46,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030985992] [2024-11-13 16:27:46,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:27:46,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 16:27:46,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:46,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 16:27:46,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-11-13 16:27:46,709 INFO L87 Difference]: Start difference. First operand 657 states and 857 transitions. Second operand has 22 states, 19 states have (on average 6.894736842105263) internal successors, (131), 22 states have internal predecessors, (131), 11 states have call successors, (26), 2 states have call predecessors, (26), 5 states have return successors, (25), 6 states have call predecessors, (25), 11 states have call successors, (25) [2024-11-13 16:27:47,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:47,307 INFO L93 Difference]: Finished difference Result 1240 states and 1651 transitions. [2024-11-13 16:27:47,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 16:27:47,308 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.894736842105263) internal successors, (131), 22 states have internal predecessors, (131), 11 states have call successors, (26), 2 states have call predecessors, (26), 5 states have return successors, (25), 6 states have call predecessors, (25), 11 states have call successors, (25) Word has length 105 [2024-11-13 16:27:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:47,312 INFO L225 Difference]: With dead ends: 1240 [2024-11-13 16:27:47,312 INFO L226 Difference]: Without dead ends: 604 [2024-11-13 16:27:47,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 215 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2024-11-13 16:27:47,315 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 186 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:47,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 604 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:27:47,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-13 16:27:47,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 573. [2024-11-13 16:27:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 437 states have (on average 1.1853546910755148) internal successors, (518), 458 states have internal predecessors, (518), 78 states have call successors, (78), 36 states have call predecessors, (78), 57 states have return successors, (132), 78 states have call predecessors, (132), 73 states have call successors, (132) [2024-11-13 16:27:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 728 transitions. [2024-11-13 16:27:47,469 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 728 transitions. Word has length 105 [2024-11-13 16:27:47,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:47,472 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 728 transitions. [2024-11-13 16:27:47,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.894736842105263) internal successors, (131), 22 states have internal predecessors, (131), 11 states have call successors, (26), 2 states have call predecessors, (26), 5 states have return successors, (25), 6 states have call predecessors, (25), 11 states have call successors, (25) [2024-11-13 16:27:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 728 transitions. [2024-11-13 16:27:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 16:27:47,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:47,478 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 16:27:47,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-13 16:27:47,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:27:47,678 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:47,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:47,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1196662556, now seen corresponding path program 1 times [2024-11-13 16:27:47,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:47,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182180066] [2024-11-13 16:27:47,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:47,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:47,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:27:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:47,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:27:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 16:27:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:27:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:47,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:27:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:47,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:27:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:47,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:27:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:47,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:27:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:47,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:27:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:47,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 16:27:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 16:27:47,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:47,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182180066] [2024-11-13 16:27:47,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182180066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:47,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:47,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:27:47,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701931706] [2024-11-13 16:27:47,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:47,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:27:47,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:47,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:27:47,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:27:47,972 INFO L87 Difference]: Start difference. First operand 573 states and 728 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-13 16:27:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:48,258 INFO L93 Difference]: Finished difference Result 936 states and 1145 transitions. [2024-11-13 16:27:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:27:48,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 105 [2024-11-13 16:27:48,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:48,263 INFO L225 Difference]: With dead ends: 936 [2024-11-13 16:27:48,263 INFO L226 Difference]: Without dead ends: 548 [2024-11-13 16:27:48,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:27:48,265 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 6 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:48,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 288 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:27:48,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-13 16:27:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2024-11-13 16:27:48,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 413 states have (on average 1.179176755447942) internal successors, (487), 433 states have internal predecessors, (487), 78 states have call successors, (78), 36 states have call predecessors, (78), 56 states have return successors, (131), 78 states have call predecessors, (131), 73 states have call successors, (131) [2024-11-13 16:27:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 696 transitions. [2024-11-13 16:27:48,414 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 696 transitions. Word has length 105 [2024-11-13 16:27:48,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:48,414 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 696 transitions. [2024-11-13 16:27:48,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-13 16:27:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 696 transitions. [2024-11-13 16:27:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:27:48,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:48,416 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 16:27:48,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 16:27:48,417 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:48,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:48,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1258535477, now seen corresponding path program 1 times [2024-11-13 16:27:48,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:48,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080301019] [2024-11-13 16:27:48,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:48,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:27:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:48,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:27:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:48,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 16:27:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:48,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:27:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:48,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:27:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:48,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:27:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:48,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:27:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:48,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:27:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 16:27:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:48,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 16:27:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:48,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 16:27:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-13 16:27:48,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:48,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080301019] [2024-11-13 16:27:48,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080301019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:27:48,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204463596] [2024-11-13 16:27:48,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:48,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:27:48,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:27:48,996 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:27:48,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 16:27:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:49,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-13 16:27:49,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:27:49,478 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 13 treesize of output 1 [2024-11-13 16:27:49,481 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 13 treesize of output 1 [2024-11-13 16:27:53,901 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_11| Int)) (not (= 0 (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_11|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_11| Int)) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_11|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|) 0)))) is different from true [2024-11-13 16:27:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2024-11-13 16:27:54,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:27:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 16 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 16:27:56,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204463596] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:27:56,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:27:56,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 23, 21] total 45 [2024-11-13 16:27:56,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459488268] [2024-11-13 16:27:56,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:27:56,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-13 16:27:56,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:56,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-13 16:27:56,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1747, Unknown=1, NotChecked=84, Total=1980 [2024-11-13 16:27:56,670 INFO L87 Difference]: Start difference. First operand 548 states and 696 transitions. Second operand has 45 states, 41 states have (on average 3.5853658536585367) internal successors, (147), 38 states have internal predecessors, (147), 14 states have call successors, (26), 5 states have call predecessors, (26), 10 states have return successors, (26), 11 states have call predecessors, (26), 13 states have call successors, (26) [2024-11-13 16:28:00,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:28:04,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:28:08,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:28:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:28:33,590 INFO L93 Difference]: Finished difference Result 1318 states and 1682 transitions. [2024-11-13 16:28:33,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-13 16:28:33,590 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 3.5853658536585367) internal successors, (147), 38 states have internal predecessors, (147), 14 states have call successors, (26), 5 states have call predecessors, (26), 10 states have return successors, (26), 11 states have call predecessors, (26), 13 states have call successors, (26) Word has length 115 [2024-11-13 16:28:33,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:28:33,595 INFO L225 Difference]: With dead ends: 1318 [2024-11-13 16:28:33,595 INFO L226 Difference]: Without dead ends: 745 [2024-11-13 16:28:33,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 216 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1675 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=656, Invalid=6825, Unknown=5, NotChecked=170, Total=7656 [2024-11-13 16:28:33,599 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 181 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 71 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 2347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:28:33,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1651 Invalid, 2347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2067 Invalid, 3 Unknown, 206 Unchecked, 14.1s Time] [2024-11-13 16:28:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-13 16:28:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 567. [2024-11-13 16:28:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 435 states have (on average 1.1655172413793105) internal successors, (507), 452 states have internal predecessors, (507), 71 states have call successors, (71), 36 states have call predecessors, (71), 60 states have return successors, (115), 78 states have call predecessors, (115), 67 states have call successors, (115) [2024-11-13 16:28:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 693 transitions. [2024-11-13 16:28:33,741 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 693 transitions. Word has length 115 [2024-11-13 16:28:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:28:33,741 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 693 transitions. [2024-11-13 16:28:33,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 3.5853658536585367) internal successors, (147), 38 states have internal predecessors, (147), 14 states have call successors, (26), 5 states have call predecessors, (26), 10 states have return successors, (26), 11 states have call predecessors, (26), 13 states have call successors, (26) [2024-11-13 16:28:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 693 transitions. [2024-11-13 16:28:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 16:28:33,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:28:33,743 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-11-13 16:28:33,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-13 16:28:33,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-13 16:28:33,944 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:28:33,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:28:33,944 INFO L85 PathProgramCache]: Analyzing trace with hash 481109908, now seen corresponding path program 1 times [2024-11-13 16:28:33,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:28:33,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480768556] [2024-11-13 16:28:33,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:28:33,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:28:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:34,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:28:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:28:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:34,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 16:28:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:34,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:28:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:34,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:28:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:34,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:28:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:34,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:28:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:34,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:28:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:34,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 16:28:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:34,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 16:28:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:34,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:28:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-13 16:28:34,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:28:34,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480768556] [2024-11-13 16:28:34,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480768556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:28:34,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273660217] [2024-11-13 16:28:34,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:28:34,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:28:34,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:28:34,609 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:28:34,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 16:28:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:35,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 16:28:35,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:28:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-13 16:28:35,153 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:28:35,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273660217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:28:35,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:28:35,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2024-11-13 16:28:35,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261393259] [2024-11-13 16:28:35,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:28:35,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:28:35,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:28:35,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:28:35,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-13 16:28:35,155 INFO L87 Difference]: Start difference. First operand 567 states and 693 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-13 16:28:35,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:28:35,305 INFO L93 Difference]: Finished difference Result 965 states and 1169 transitions. [2024-11-13 16:28:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:28:35,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 122 [2024-11-13 16:28:35,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:28:35,308 INFO L225 Difference]: With dead ends: 965 [2024-11-13 16:28:35,308 INFO L226 Difference]: Without dead ends: 504 [2024-11-13 16:28:35,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-13 16:28:35,309 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:28:35,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 423 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:28:35,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-13 16:28:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 458. [2024-11-13 16:28:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 348 states have (on average 1.1522988505747127) internal successors, (401), 361 states have internal predecessors, (401), 62 states have call successors, (62), 30 states have call predecessors, (62), 47 states have return successors, (96), 66 states have call predecessors, (96), 58 states have call successors, (96) [2024-11-13 16:28:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 559 transitions. [2024-11-13 16:28:35,445 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 559 transitions. Word has length 122 [2024-11-13 16:28:35,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:28:35,445 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 559 transitions. [2024-11-13 16:28:35,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-13 16:28:35,445 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 559 transitions. [2024-11-13 16:28:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 16:28:35,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:28:35,447 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 16:28:35,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-13 16:28:35,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 16:28:35,647 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:28:35,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:28:35,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1021839261, now seen corresponding path program 1 times [2024-11-13 16:28:35,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:28:35,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096970534] [2024-11-13 16:28:35,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:28:35,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:28:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:36,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:28:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:36,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:28:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:36,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:28:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:36,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:28:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:36,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:28:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:36,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:28:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:36,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:28:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:36,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 16:28:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:36,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 16:28:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:36,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 16:28:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-13 16:28:36,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:28:36,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096970534] [2024-11-13 16:28:36,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096970534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:28:36,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:28:36,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 16:28:36,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966902350] [2024-11-13 16:28:36,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:28:36,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 16:28:36,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:28:36,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 16:28:36,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:28:36,519 INFO L87 Difference]: Start difference. First operand 458 states and 559 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-13 16:28:37,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:28:37,004 INFO L93 Difference]: Finished difference Result 590 states and 708 transitions. [2024-11-13 16:28:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 16:28:37,005 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 106 [2024-11-13 16:28:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:28:37,008 INFO L225 Difference]: With dead ends: 590 [2024-11-13 16:28:37,008 INFO L226 Difference]: Without dead ends: 439 [2024-11-13 16:28:37,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-13 16:28:37,009 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 15 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:28:37,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 373 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:28:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-13 16:28:37,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2024-11-13 16:28:37,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 336 states have (on average 1.1488095238095237) internal successors, (386), 346 states have internal predecessors, (386), 60 states have call successors, (60), 28 states have call predecessors, (60), 42 states have return successors, (91), 64 states have call predecessors, (91), 56 states have call successors, (91) [2024-11-13 16:28:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 537 transitions. [2024-11-13 16:28:37,143 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 537 transitions. Word has length 106 [2024-11-13 16:28:37,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:28:37,144 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 537 transitions. [2024-11-13 16:28:37,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-13 16:28:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 537 transitions. [2024-11-13 16:28:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 16:28:37,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:28:37,145 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 16:28:37,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 16:28:37,146 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:28:37,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:28:37,146 INFO L85 PathProgramCache]: Analyzing trace with hash -471769434, now seen corresponding path program 1 times [2024-11-13 16:28:37,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:28:37,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499550174] [2024-11-13 16:28:37,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:28:37,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:28:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:37,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 16:28:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:37,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 16:28:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:37,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:28:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:37,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:28:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:37,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:28:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:37,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:28:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:37,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:28:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:37,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 16:28:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:37,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 16:28:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:37,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 16:28:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:28:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 16:28:37,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:28:37,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499550174] [2024-11-13 16:28:37,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499550174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:28:37,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:28:37,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 16:28:37,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603775516] [2024-11-13 16:28:37,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:28:37,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:28:37,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:28:37,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:28:37,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:28:37,700 INFO L87 Difference]: Start difference. First operand 439 states and 537 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-13 16:28:37,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:28:37,872 INFO L93 Difference]: Finished difference Result 465 states and 566 transitions. [2024-11-13 16:28:37,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:28:37,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 113 [2024-11-13 16:28:37,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:28:37,875 INFO L225 Difference]: With dead ends: 465 [2024-11-13 16:28:37,875 INFO L226 Difference]: Without dead ends: 463 [2024-11-13 16:28:37,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:28:37,876 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 3 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:28:37,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 426 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:28:37,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-13 16:28:38,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 459. [2024-11-13 16:28:38,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 348 states have (on average 1.1436781609195403) internal successors, (398), 358 states have internal predecessors, (398), 64 states have call successors, (64), 32 states have call predecessors, (64), 46 states have return successors, (95), 68 states have call predecessors, (95), 60 states have call successors, (95) [2024-11-13 16:28:38,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 557 transitions. [2024-11-13 16:28:38,019 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 557 transitions. Word has length 113 [2024-11-13 16:28:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:28:38,020 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 557 transitions. [2024-11-13 16:28:38,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-13 16:28:38,020 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 557 transitions. [2024-11-13 16:28:38,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 16:28:38,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:28:38,021 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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-11-13 16:28:38,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 16:28:38,022 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:28:38,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:28:38,022 INFO L85 PathProgramCache]: Analyzing trace with hash 178096445, now seen corresponding path program 1 times [2024-11-13 16:28:38,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:28:38,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798888127] [2024-11-13 16:28:38,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:28:38,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:28:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:28:38,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:28:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:28:38,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:28:38,187 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 16:28:38,189 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 16:28:38,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 16:28:38,194 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-13 16:28:38,282 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:28:38,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 04:28:38 BoogieIcfgContainer [2024-11-13 16:28:38,284 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 16:28:38,285 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:28:38,285 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:28:38,285 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:28:38,286 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:24:08" (3/4) ... [2024-11-13 16:28:38,287 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 16:28:38,367 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 16:28:38,367 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:28:38,369 INFO L158 Benchmark]: Toolchain (without parser) took 273640.24ms. Allocated memory was 109.1MB in the beginning and 755.0MB in the end (delta: 645.9MB). Free memory was 77.3MB in the beginning and 324.2MB in the end (delta: -246.9MB). Peak memory consumption was 392.2MB. Max. memory is 16.1GB. [2024-11-13 16:28:38,369 INFO L158 Benchmark]: CDTParser took 1.18ms. Allocated memory is still 83.9MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:28:38,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2585.55ms. Allocated memory is still 109.1MB. Free memory was 77.3MB in the beginning and 44.8MB in the end (delta: 32.5MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. [2024-11-13 16:28:38,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.71ms. Allocated memory is still 109.1MB. Free memory was 44.8MB in the beginning and 39.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:28:38,370 INFO L158 Benchmark]: Boogie Preprocessor took 93.93ms. Allocated memory is still 109.1MB. Free memory was 39.4MB in the beginning and 35.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:28:38,370 INFO L158 Benchmark]: RCFGBuilder took 645.31ms. Allocated memory is still 109.1MB. Free memory was 35.7MB in the beginning and 52.8MB in the end (delta: -17.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-13 16:28:38,371 INFO L158 Benchmark]: TraceAbstraction took 270138.35ms. Allocated memory was 109.1MB in the beginning and 755.0MB in the end (delta: 645.9MB). Free memory was 52.8MB in the beginning and 328.4MB in the end (delta: -275.5MB). Peak memory consumption was 371.8MB. Max. memory is 16.1GB. [2024-11-13 16:28:38,371 INFO L158 Benchmark]: Witness Printer took 81.87ms. Allocated memory is still 755.0MB. Free memory was 328.4MB in the beginning and 324.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:28:38,371 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18ms. Allocated memory is still 83.9MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2585.55ms. Allocated memory is still 109.1MB. Free memory was 77.3MB in the beginning and 44.8MB in the end (delta: 32.5MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.71ms. Allocated memory is still 109.1MB. Free memory was 44.8MB in the beginning and 39.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.93ms. Allocated memory is still 109.1MB. Free memory was 39.4MB in the beginning and 35.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 645.31ms. Allocated memory is still 109.1MB. Free memory was 35.7MB in the beginning and 52.8MB in the end (delta: -17.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 270138.35ms. Allocated memory was 109.1MB in the beginning and 755.0MB in the end (delta: 645.9MB). Free memory was 52.8MB in the beginning and 328.4MB in the end (delta: -275.5MB). Peak memory consumption was 371.8MB. Max. memory is 16.1GB. * Witness Printer took 81.87ms. Allocated memory is still 755.0MB. Free memory was 328.4MB in the beginning and 324.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 223]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7326] static __thread int tl_last_error = 0; VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7360] CALL aws_linked_list_rbegin_harness() [L7344] struct aws_linked_list list; [L7346] CALL ensure_linked_list_is_allocated(&list, 20) [L6743] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L266] return __VERIFIER_nondet_ulong(); [L6743] RET, EXPR nondet_uint64_t() VAL [list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6743] size_t length = nondet_uint64_t(); [L6744] CALL assume_abort_if_not(length <= max_length) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6744] RET assume_abort_if_not(length <= max_length) VAL [length=((unsigned __int128) 1 << 64), list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6746-L6747] list->head.prev = ((void *)0) [L6749-L6750] list->tail.next = ((void *)0) [L6753] struct aws_linked_list_node *curr = &list->head; [L6755] size_t i = 0; VAL [curr={7:0}, i=0, length=((unsigned __int128) 1 << 64), list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6755] COND FALSE !(i < length) VAL [curr={7:0}, list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6764] curr->next = &list->tail [L6765] list->tail.prev = curr VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7346] RET ensure_linked_list_is_allocated(&list, 20) [L7349] CALL, EXPR aws_linked_list_is_valid(&list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L7349] RET, EXPR aws_linked_list_is_valid(&list) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7349] CALL assume_abort_if_not(aws_linked_list_is_valid(&list)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7349] RET assume_abort_if_not(aws_linked_list_is_valid(&list)) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7354] CALL aws_linked_list_rbegin(&list) [L4812] CALL, EXPR aws_linked_list_is_valid(list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4812] RET, EXPR aws_linked_list_is_valid(list) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4812] CALL assume_abort_if_not((aws_linked_list_is_valid(list))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4812] RET assume_abort_if_not((aws_linked_list_is_valid(list))) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4813] EXPR list->tail.prev [L4813] struct aws_linked_list_node *rval = list->tail.prev; [L4814] CALL, EXPR aws_linked_list_is_valid(list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4814] RET, EXPR aws_linked_list_is_valid(list) VAL [list={7:0}, rval={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4814] CALL __VERIFIER_assert(!((aws_linked_list_is_valid(list)))) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] COND TRUE !cond VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] reach_error() VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 270.0s, OverallIterations: 31, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 162.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 50 mSolverCounterUnknown, 2207 SdHoareTripleChecker+Valid, 114.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2085 mSDsluCounter, 17856 SdHoareTripleChecker+Invalid, 112.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 820 IncrementalHoareTripleChecker+Unchecked, 15609 mSDsCounter, 676 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11161 IncrementalHoareTripleChecker+Invalid, 12707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 676 mSolverCounterUnsat, 2247 mSDtfsCounter, 11161 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3531 GetRequests, 2863 SyntacticMatches, 50 SemanticMatches, 618 ConstructedPredicates, 10 IntricatePredicates, 3 DeprecatedPredicates, 4450 ImplicationChecksByTransitivity, 103.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=657occurred in iteration=24, InterpolantAutomatonStates: 397, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 838 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 93.8s InterpolantComputationTime, 4473 NumberOfCodeBlocks, 4473 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 5153 ConstructedInterpolants, 441 QuantifiedInterpolants, 39249 SizeOfPredicates, 111 NumberOfNonLiveVariables, 8219 ConjunctsInSsa, 844 ConjunctsInUnsatCore, 58 InterpolantComputations, 22 PerfectInterpolantSequences, 2948/3407 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-13 16:28:38,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_664c900f-f1a5-4c84-8239-0a1656ec6166/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE