./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/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_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB --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-d790fec [2024-11-28 04:26:02,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:26:02,104 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-28 04:26:02,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:26:02,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:26:02,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:26:02,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:26:02,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:26:02,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:26:02,151 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:26:02,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:26:02,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:26:02,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:26:02,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:26:02,152 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:26:02,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:26:02,152 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 04:26:02,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:26:02,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:26:02,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 04:26:02,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:26:02,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 04:26:02,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 04:26:02,154 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:26:02,154 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:26:02,154 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:26:02,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:26:02,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:26:02,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:26:02,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:26:02,155 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:26:02,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:26:02,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:26:02,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:26:02,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:26:02,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:26:02,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:26:02,156 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 04:26:02,156 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 04:26:02,156 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:26:02,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:26:02,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:26:02,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:26:02,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:26:02,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:26:02,156 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_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB 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-28 04:26:02,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:26:02,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:26:02,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:26:02,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:26:02,456 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:26:02,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i [2024-11-28 04:26:05,362 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/data/146f0da48/3214b2b7156d4526a22fd1fb94d400c7/FLAGfc411dd49 [2024-11-28 04:26:05,979 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:26:05,979 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i [2024-11-28 04:26:06,032 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/data/146f0da48/3214b2b7156d4526a22fd1fb94d400c7/FLAGfc411dd49 [2024-11-28 04:26:06,419 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/data/146f0da48/3214b2b7156d4526a22fd1fb94d400c7 [2024-11-28 04:26:06,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:26:06,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:26:06,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:26:06,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:26:06,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:26:06,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:26:06" (1/1) ... [2024-11-28 04:26:06,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65ac5d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:26:06, skipping insertion in model container [2024-11-28 04:26:06,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:26:06" (1/1) ... [2024-11-28 04:26:06,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:26:06,821 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_279d0164-38ff-4154-bd6d-6b94ca3482d1/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4496,4509] [2024-11-28 04:26:06,828 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_279d0164-38ff-4154-bd6d-6b94ca3482d1/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4556,4569] [2024-11-28 04:26:07,665 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:07,666 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:07,666 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:07,667 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:07,668 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:07,684 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:07,685 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:07,687 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:07,688 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:07,690 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:07,692 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:07,692 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:07,693 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:08,335 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_279d0164-38ff-4154-bd6d-6b94ca3482d1/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[150690,150703] [2024-11-28 04:26:08,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:26:08,352 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:26:08,367 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_279d0164-38ff-4154-bd6d-6b94ca3482d1/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4496,4509] [2024-11-28 04:26:08,367 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_279d0164-38ff-4154-bd6d-6b94ca3482d1/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4556,4569] [2024-11-28 04:26:08,445 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:08,445 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:08,486 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:08,487 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:08,488 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:08,501 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:08,506 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:08,508 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:08,508 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:08,510 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:08,510 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:08,511 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:08,511 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:26:08,646 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_279d0164-38ff-4154-bd6d-6b94ca3482d1/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[150690,150703] [2024-11-28 04:26:08,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:26:08,814 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:26:08,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:26:08 WrapperNode [2024-11-28 04:26:08,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:26:08,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:26:08,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:26:08,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:26:08,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:26:08" (1/1) ... [2024-11-28 04:26:08,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:26:08" (1/1) ... [2024-11-28 04:26:08,922 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 141 [2024-11-28 04:26:08,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:26:08,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:26:08,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:26:08,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:26:08,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:26:08" (1/1) ... [2024-11-28 04:26:08,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:26:08" (1/1) ... [2024-11-28 04:26:08,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:26:08" (1/1) ... [2024-11-28 04:26:08,973 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2024-11-28 04:26:08,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:26:08" (1/1) ... [2024-11-28 04:26:08,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:26:08" (1/1) ... [2024-11-28 04:26:08,995 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:26:08" (1/1) ... [2024-11-28 04:26:09,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:26:08" (1/1) ... [2024-11-28 04:26:09,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:26:08" (1/1) ... [2024-11-28 04:26:09,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:26:08" (1/1) ... [2024-11-28 04:26:09,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:26:08" (1/1) ... [2024-11-28 04:26:09,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:26:09,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:26:09,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:26:09,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:26:09,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:26:08" (1/1) ... [2024-11-28 04:26:09,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:26:09,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:26:09,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:26:09,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:26:09,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:26:09,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 04:26:09,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 04:26:09,119 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-28 04:26:09,119 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-28 04:26:09,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:26:09,119 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-28 04:26:09,119 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-28 04:26:09,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:26:09,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:26:09,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:26:09,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 04:26:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:26:09,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:26:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 04:26:09,120 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 04:26:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 04:26:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:26:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:26:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 04:26:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 04:26:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 04:26:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 04:26:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-28 04:26:09,120 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-28 04:26:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:26:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:26:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 04:26:09,372 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:26:09,375 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:26:09,675 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-28 04:26:09,675 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:26:09,688 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:26:09,688 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 04:26:09,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:26:09 BoogieIcfgContainer [2024-11-28 04:26:09,689 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:26:09,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:26:09,691 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:26:09,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:26:09,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:26:06" (1/3) ... [2024-11-28 04:26:09,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7442f23b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:26:09, skipping insertion in model container [2024-11-28 04:26:09,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:26:08" (2/3) ... [2024-11-28 04:26:09,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7442f23b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:26:09, skipping insertion in model container [2024-11-28 04:26:09,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:26:09" (3/3) ... [2024-11-28 04:26:09,704 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness_negated.i [2024-11-28 04:26:09,724 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:26:09,726 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_rbegin_harness_negated.i that has 6 procedures, 69 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-28 04:26:09,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:26:09,799 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;@153f4b34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:26:09,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 04:26:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 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-28 04:26:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 04:26:09,815 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:26:09,815 INFO L218 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-28 04:26:09,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:26:09,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:26:09,823 INFO L85 PathProgramCache]: Analyzing trace with hash 324213296, now seen corresponding path program 1 times [2024-11-28 04:26:09,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:26:09,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387113572] [2024-11-28 04:26:09,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:26:09,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:26:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:26:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-28 04:26:10,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:26:10,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387113572] [2024-11-28 04:26:10,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387113572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:26:10,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659900025] [2024-11-28 04:26:10,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:26:10,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:26:10,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:26:10,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:26:10,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:26:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:26:10,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 04:26:10,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:26:10,567 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-28 04:26:10,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:26:10,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659900025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:26:10,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:26:10,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-28 04:26:10,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734127849] [2024-11-28 04:26:10,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:26:10,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 04:26:10,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:26:10,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 04:26:10,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:26:10,621 INFO L87 Difference]: Start difference. First operand has 69 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-28 04:26:10,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:26:10,653 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2024-11-28 04:26:10,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 04:26:10,656 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-28 04:26:10,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:26:10,664 INFO L225 Difference]: With dead ends: 130 [2024-11-28 04:26:10,665 INFO L226 Difference]: Without dead ends: 64 [2024-11-28 04:26:10,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 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-28 04:26:10,673 INFO L435 NwaCegarLoop]: 88 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, 88 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-28 04:26:10,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:26:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-28 04:26:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-28 04:26:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 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-28 04:26:10,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2024-11-28 04:26:10,713 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 68 [2024-11-28 04:26:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:26:10,713 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2024-11-28 04:26:10,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-28 04:26:10,714 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2024-11-28 04:26:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 04:26:10,716 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:26:10,716 INFO L218 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-28 04:26:10,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 04:26:10,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-28 04:26:10,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:26:10,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:26:10,918 INFO L85 PathProgramCache]: Analyzing trace with hash -962094674, now seen corresponding path program 1 times [2024-11-28 04:26:10,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:26:10,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874563092] [2024-11-28 04:26:10,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:26:10,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:26:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:26:11,962 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-28 04:26:11,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:26:11,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874563092] [2024-11-28 04:26:11,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874563092] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:26:11,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503500113] [2024-11-28 04:26:11,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:26:11,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:26:11,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:26:11,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:26:11,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:26:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:26:12,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-28 04:26:12,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:26:12,362 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-28 04:26:12,389 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-28 04:26:12,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:26:12,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:26:12,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:26:12,539 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-28 04:26:12,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:26:12,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:26:12,562 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 32 treesize of output 35 [2024-11-28 04:26:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-28 04:26:15,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:26:15,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503500113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:26:15,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:26:15,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2024-11-28 04:26:15,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832072384] [2024-11-28 04:26:15,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:26:15,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:26:15,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:26:15,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:26:15,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-28 04:26:15,060 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-28 04:26:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:26:16,054 INFO L93 Difference]: Finished difference Result 174 states and 234 transitions. [2024-11-28 04:26:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:26:16,055 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2024-11-28 04:26:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:26:16,058 INFO L225 Difference]: With dead ends: 174 [2024-11-28 04:26:16,058 INFO L226 Difference]: Without dead ends: 122 [2024-11-28 04:26:16,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-28 04:26:16,060 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 54 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:26:16,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 446 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 04:26:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-28 04:26:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2024-11-28 04:26:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 85 states have internal predecessors, (109), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-28 04:26:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 155 transitions. [2024-11-28 04:26:16,083 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 155 transitions. Word has length 68 [2024-11-28 04:26:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:26:16,083 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 155 transitions. [2024-11-28 04:26:16,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-28 04:26:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 155 transitions. [2024-11-28 04:26:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 04:26:16,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:26:16,086 INFO L218 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-28 04:26:16,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 04:26:16,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:26:16,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:26:16,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:26:16,292 INFO L85 PathProgramCache]: Analyzing trace with hash 536177768, now seen corresponding path program 1 times [2024-11-28 04:26:16,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:26:16,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509646225] [2024-11-28 04:26:16,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:26:16,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:26:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:26:16,810 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-28 04:26:16,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:26:16,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509646225] [2024-11-28 04:26:16,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509646225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:26:16,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239194740] [2024-11-28 04:26:16,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:26:16,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:26:16,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:26:16,812 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:26:16,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:26:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:26:16,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-28 04:26:17,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:26:17,172 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2024-11-28 04:26:17,172 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 76 treesize of output 128 [2024-11-28 04:26:17,182 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-28 04:26:17,199 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:26:17,200 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-28 04:26:17,254 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:26:17,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2024-11-28 04:26:17,263 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 13 treesize of output 9 [2024-11-28 04:26:45,616 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse1 .cse2 .cse0)) .cse0) .cse1))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse4))) (= .cse3 (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse3 .cse5 .cse4)) .cse4)))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse4))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|))))) is different from true [2024-11-28 04:26:50,129 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) .cse2))) (and (or (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse1))) (= .cse0 (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| (store .cse0 .cse2 .cse1)) .cse1)))) (= .cse1 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse3))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse4 .cse5 .cse3)) .cse3) .cse4))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse7))) (= .cse6 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse6 .cse8 .cse7)) .cse7)))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse7))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|)))) (<= 2 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (<= |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| .cse1)))) is different from true [2024-11-28 04:27:15,683 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) .cse2))) (and (or (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse1))) (= .cse0 (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| (store .cse0 .cse2 .cse1)) .cse1)))) (= .cse1 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse3))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse4 .cse5 .cse3)) .cse3) .cse4))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse7))) (= .cse6 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse6 .cse8 .cse7)) .cse7)))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse7))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|)))) (<= 2 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| (store .cse10 .cse11 .cse9)) .cse9) .cse10))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| .cse9)))))))) (<= |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| .cse1)))) is different from true [2024-11-28 04:27:15,824 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse1 .cse2 .cse0)) .cse0) .cse1))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_5| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse3))) (= .cse4 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5| (store .cse4 .cse5 .cse3)) .cse3))))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse7))) (= .cse6 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse6 .cse8 .cse7)) .cse7)))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse7))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| (store .cse10 .cse11 .cse9)) .cse9) .cse10))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| .cse9))))))))) is different from true [2024-11-28 04:27:17,002 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse1 .cse2 .cse0)) .cse0) .cse1))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_5| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse3))) (= .cse4 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5| (store .cse4 .cse5 .cse3)) .cse3))))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse7))) (= .cse6 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse6 .cse8 .cse7)) .cse7)))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse7))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_6| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_6| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6|) .cse11))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6| .cse9) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6| (store .cse10 .cse11 .cse9)) .cse9) .cse10))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_6| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) .cse14))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse12))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| (store .cse13 .cse14 .cse12)) .cse12) .cse13))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| .cse12))))))))) is different from true [2024-11-28 04:27:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-28 04:27:19,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:27:24,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:27:24,206 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 238 treesize of output 232 [2024-11-28 04:27:24,215 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 162 treesize of output 146 [2024-11-28 04:27:24,267 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 129 treesize of output 117 [2024-11-28 04:27:33,605 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-28 04:27:33,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239194740] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-28 04:27:33,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:27:33,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 20] total 33 [2024-11-28 04:27:33,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411688825] [2024-11-28 04:27:33,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:27:33,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:27:33,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:27:33,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:27:33,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=637, Unknown=39, NotChecked=280, Total=1056 [2024-11-28 04:27:33,608 INFO L87 Difference]: Start difference. First operand 117 states and 155 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-28 04:27:46,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:27:46,515 INFO L93 Difference]: Finished difference Result 197 states and 277 transitions. [2024-11-28 04:27:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:27:46,516 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2024-11-28 04:27:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:27:46,517 INFO L225 Difference]: With dead ends: 197 [2024-11-28 04:27:46,517 INFO L226 Difference]: Without dead ends: 136 [2024-11-28 04:27:46,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 85.1s TimeCoverageRelationStatistics Valid=146, Invalid=1090, Unknown=44, NotChecked=360, Total=1640 [2024-11-28 04:27:46,523 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 156 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:27:46,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 421 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 04:27:46,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-28 04:27:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 119. [2024-11-28 04:27:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 87 states have internal predecessors, (111), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-28 04:27:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 157 transitions. [2024-11-28 04:27:46,581 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 157 transitions. Word has length 68 [2024-11-28 04:27:46,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:27:46,582 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 157 transitions. [2024-11-28 04:27:46,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-28 04:27:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 157 transitions. [2024-11-28 04:27:46,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 04:27:46,583 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:27:46,584 INFO L218 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-28 04:27:46,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 04:27:46,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:27:46,786 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:27:46,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:27:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1561950370, now seen corresponding path program 1 times [2024-11-28 04:27:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:27:46,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453723945] [2024-11-28 04:27:46,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:27:46,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:27:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:27:47,166 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-28 04:27:47,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:27:47,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453723945] [2024-11-28 04:27:47,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453723945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:27:47,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:27:47,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:27:47,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637571181] [2024-11-28 04:27:47,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:27:47,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:27:47,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:27:47,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:27:47,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:27:47,168 INFO L87 Difference]: Start difference. First operand 119 states and 157 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-28 04:27:47,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:27:47,235 INFO L93 Difference]: Finished difference Result 137 states and 182 transitions. [2024-11-28 04:27:47,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:27:47,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-28 04:27:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:27:47,237 INFO L225 Difference]: With dead ends: 137 [2024-11-28 04:27:47,237 INFO L226 Difference]: Without dead ends: 135 [2024-11-28 04:27:47,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-28 04:27:47,238 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 3 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 392 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-28 04:27:47,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 392 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:27:47,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-28 04:27:47,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2024-11-28 04:27:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.2795698924731183) internal successors, (119), 97 states have internal predecessors, (119), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-28 04:27:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 177 transitions. [2024-11-28 04:27:47,276 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 177 transitions. Word has length 68 [2024-11-28 04:27:47,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:27:47,276 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 177 transitions. [2024-11-28 04:27:47,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-28 04:27:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 177 transitions. [2024-11-28 04:27:47,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 04:27:47,280 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:27:47,280 INFO L218 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-28 04:27:47,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:27:47,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:27:47,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:27:47,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1823129154, now seen corresponding path program 1 times [2024-11-28 04:27:47,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:27:47,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800048143] [2024-11-28 04:27:47,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:27:47,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:27:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:27:47,547 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-28 04:27:47,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:27:47,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800048143] [2024-11-28 04:27:47,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800048143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:27:47,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:27:47,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 04:27:47,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001168918] [2024-11-28 04:27:47,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:27:47,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:27:47,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:27:47,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:27:47,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:27:47,551 INFO L87 Difference]: Start difference. First operand 133 states and 177 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 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-28 04:27:47,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:27:47,713 INFO L93 Difference]: Finished difference Result 258 states and 345 transitions. [2024-11-28 04:27:47,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:27:47,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 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-28 04:27:47,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:27:47,715 INFO L225 Difference]: With dead ends: 258 [2024-11-28 04:27:47,717 INFO L226 Difference]: Without dead ends: 137 [2024-11-28 04:27:47,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:27:47,721 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 21 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:27:47,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 354 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:27:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-28 04:27:47,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2024-11-28 04:27:47,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 97 states have internal predecessors, (117), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-28 04:27:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 175 transitions. [2024-11-28 04:27:47,756 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 175 transitions. Word has length 70 [2024-11-28 04:27:47,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:27:47,756 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 175 transitions. [2024-11-28 04:27:47,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 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-28 04:27:47,757 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 175 transitions. [2024-11-28 04:27:47,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 04:27:47,761 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:27:47,762 INFO L218 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-28 04:27:47,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:27:47,762 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:27:47,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:27:47,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1713818576, now seen corresponding path program 1 times [2024-11-28 04:27:47,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:27:47,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285178044] [2024-11-28 04:27:47,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:27:47,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:27:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:27:48,039 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-28 04:27:48,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:27:48,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285178044] [2024-11-28 04:27:48,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285178044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:27:48,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:27:48,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:27:48,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355541037] [2024-11-28 04:27:48,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:27:48,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:27:48,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:27:48,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:27:48,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:27:48,041 INFO L87 Difference]: Start difference. First operand 133 states and 175 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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-28 04:27:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:27:48,231 INFO L93 Difference]: Finished difference Result 270 states and 361 transitions. [2024-11-28 04:27:48,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:27:48,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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 72 [2024-11-28 04:27:48,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:27:48,234 INFO L225 Difference]: With dead ends: 270 [2024-11-28 04:27:48,236 INFO L226 Difference]: Without dead ends: 147 [2024-11-28 04:27:48,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:27:48,238 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 30 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:27:48,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 399 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:27:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-28 04:27:48,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 135. [2024-11-28 04:27:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 99 states have internal predecessors, (119), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-28 04:27:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 177 transitions. [2024-11-28 04:27:48,265 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 177 transitions. Word has length 72 [2024-11-28 04:27:48,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:27:48,265 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 177 transitions. [2024-11-28 04:27:48,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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-28 04:27:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 177 transitions. [2024-11-28 04:27:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 04:27:48,267 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:27:48,268 INFO L218 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-28 04:27:48,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 04:27:48,268 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:27:48,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:27:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash 831638789, now seen corresponding path program 1 times [2024-11-28 04:27:48,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:27:48,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663271682] [2024-11-28 04:27:48,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:27:48,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:27:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:27:48,618 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-28 04:27:48,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:27:48,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663271682] [2024-11-28 04:27:48,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663271682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:27:48,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:27:48,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:27:48,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612299483] [2024-11-28 04:27:48,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:27:48,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:27:48,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:27:48,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:27:48,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:27:48,621 INFO L87 Difference]: Start difference. First operand 135 states and 177 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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-28 04:27:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:27:48,826 INFO L93 Difference]: Finished difference Result 272 states and 361 transitions. [2024-11-28 04:27:48,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:27:48,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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-28 04:27:48,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:27:48,830 INFO L225 Difference]: With dead ends: 272 [2024-11-28 04:27:48,830 INFO L226 Difference]: Without dead ends: 147 [2024-11-28 04:27:48,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:27:48,834 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 27 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:27:48,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 406 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:27:48,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-28 04:27:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2024-11-28 04:27:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 97 states have (on average 1.2474226804123711) internal successors, (121), 101 states have internal predecessors, (121), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-28 04:27:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2024-11-28 04:27:48,867 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 73 [2024-11-28 04:27:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:27:48,867 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2024-11-28 04:27:48,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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-28 04:27:48,868 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2024-11-28 04:27:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 04:27:48,872 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:27:48,872 INFO L218 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] [2024-11-28 04:27:48,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:27:48,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:27:48,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:27:48,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1979775390, now seen corresponding path program 1 times [2024-11-28 04:27:48,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:27:48,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561913055] [2024-11-28 04:27:48,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:27:48,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:27:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:27:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-28 04:27:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:27:49,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561913055] [2024-11-28 04:27:49,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561913055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:27:49,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951310570] [2024-11-28 04:27:49,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:27:49,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:27:49,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:27:49,210 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:27:49,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:27:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:27:49,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-28 04:27:49,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:27:49,462 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-28 04:27:49,469 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-28 04:27:49,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:27:49,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:27:49,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:27:49,563 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-28 04:27:49,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:27:49,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:27:49,577 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 32 treesize of output 35 [2024-11-28 04:27:51,423 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-28 04:27:51,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:27:51,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951310570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:27:51,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:27:51,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2024-11-28 04:27:51,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817903487] [2024-11-28 04:27:51,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:27:51,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:27:51,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:27:51,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:27:51,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:27:51,426 INFO L87 Difference]: Start difference. First operand 137 states and 179 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-28 04:27:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:27:52,608 INFO L93 Difference]: Finished difference Result 221 states and 292 transitions. [2024-11-28 04:27:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:27:52,609 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-28 04:27:52,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:27:52,611 INFO L225 Difference]: With dead ends: 221 [2024-11-28 04:27:52,611 INFO L226 Difference]: Without dead ends: 142 [2024-11-28 04:27:52,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-28 04:27:52,612 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 79 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:27:52,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 471 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 04:27:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-28 04:27:52,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-11-28 04:27:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 103 states have internal predecessors, (123), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-28 04:27:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 181 transitions. [2024-11-28 04:27:52,634 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 181 transitions. Word has length 74 [2024-11-28 04:27:52,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:27:52,634 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 181 transitions. [2024-11-28 04:27:52,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-28 04:27:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 181 transitions. [2024-11-28 04:27:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 04:27:52,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:27:52,636 INFO L218 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] [2024-11-28 04:27:52,645 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 04:27:52,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-28 04:27:52,841 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:27:52,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:27:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash 802699420, now seen corresponding path program 1 times [2024-11-28 04:27:52,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:27:52,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12294210] [2024-11-28 04:27:52,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:27:52,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:27:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:27:53,398 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-28 04:27:53,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:27:53,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12294210] [2024-11-28 04:27:53,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12294210] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:27:53,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723683665] [2024-11-28 04:27:53,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:27:53,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:27:53,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:27:53,401 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:27:53,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:27:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:27:53,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-28 04:27:53,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:27:53,727 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-28 04:27:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:27:54,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:27:54,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723683665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:27:54,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:27:54,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2024-11-28 04:27:54,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938547641] [2024-11-28 04:27:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:27:54,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 04:27:54,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:27:54,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 04:27:54,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:27:54,616 INFO L87 Difference]: Start difference. First operand 139 states and 181 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-28 04:27:58,716 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-28 04:28:02,768 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-28 04:28:06,839 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-28 04:28:10,852 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-28 04:28:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:28:11,649 INFO L93 Difference]: Finished difference Result 229 states and 301 transitions. [2024-11-28 04:28:11,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:28:11,649 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 74 [2024-11-28 04:28:11,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:28:11,651 INFO L225 Difference]: With dead ends: 229 [2024-11-28 04:28:11,651 INFO L226 Difference]: Without dead ends: 144 [2024-11-28 04:28:11,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2024-11-28 04:28:11,652 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 202 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 55 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:28:11,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 502 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 337 Invalid, 4 Unknown, 0 Unchecked, 16.7s Time] [2024-11-28 04:28:11,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-28 04:28:11,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2024-11-28 04:28:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 105 states have internal predecessors, (125), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-28 04:28:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2024-11-28 04:28:11,686 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 74 [2024-11-28 04:28:11,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:28:11,687 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2024-11-28 04:28:11,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-28 04:28:11,687 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2024-11-28 04:28:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 04:28:11,688 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:28:11,688 INFO L218 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] [2024-11-28 04:28:11,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 04:28:11,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-28 04:28:11,889 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:28:11,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:28:11,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1003633578, now seen corresponding path program 1 times [2024-11-28 04:28:11,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:28:11,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791606449] [2024-11-28 04:28:11,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:28:11,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:28:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:28:12,023 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-28 04:28:12,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:28:12,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791606449] [2024-11-28 04:28:12,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791606449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:28:12,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941970366] [2024-11-28 04:28:12,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:28:12,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:28:12,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:28:12,026 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:28:12,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:28:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:28:12,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:28:12,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:28:12,297 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-28 04:28:12,298 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:28:12,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941970366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:28:12,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:28:12,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-11-28 04:28:12,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703894144] [2024-11-28 04:28:12,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:28:12,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:28:12,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:28:12,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:28:12,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:28:12,302 INFO L87 Difference]: Start difference. First operand 141 states and 183 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-28 04:28:12,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:28:12,475 INFO L93 Difference]: Finished difference Result 300 states and 398 transitions. [2024-11-28 04:28:12,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:28:12,476 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-28 04:28:12,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:28:12,477 INFO L225 Difference]: With dead ends: 300 [2024-11-28 04:28:12,478 INFO L226 Difference]: Without dead ends: 177 [2024-11-28 04:28:12,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 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-28 04:28:12,479 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 102 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:28:12,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 259 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:28:12,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-28 04:28:12,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-28 04:28:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 132 states have (on average 1.2575757575757576) internal successors, (166), 139 states have internal predecessors, (166), 28 states have call successors, (28), 11 states have call predecessors, (28), 16 states have return successors, (38), 26 states have call predecessors, (38), 26 states have call successors, (38) [2024-11-28 04:28:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2024-11-28 04:28:12,518 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 74 [2024-11-28 04:28:12,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:28:12,519 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2024-11-28 04:28:12,519 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-28 04:28:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2024-11-28 04:28:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-28 04:28:12,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:28:12,522 INFO L218 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, 1] [2024-11-28 04:28:12,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 04:28:12,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:28:12,727 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:28:12,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:28:12,727 INFO L85 PathProgramCache]: Analyzing trace with hash 533903658, now seen corresponding path program 1 times [2024-11-28 04:28:12,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:28:12,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15877016] [2024-11-28 04:28:12,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:28:12,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:28:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:28:13,052 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-28 04:28:13,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:28:13,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15877016] [2024-11-28 04:28:13,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15877016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:28:13,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678544132] [2024-11-28 04:28:13,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:28:13,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:28:13,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:28:13,055 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:28:13,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:28:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:28:13,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-28 04:28:13,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:28:13,359 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-28 04:28:13,369 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-28 04:28:13,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:28:13,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:28:13,456 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-28 04:28:13,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:28:13,463 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 27 treesize of output 20 [2024-11-28 04:28:13,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:28:13,475 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-28 04:28:13,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:28:13,483 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-28 04:28:13,618 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-28 04:28:13,618 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 116 treesize of output 120 [2024-11-28 04:28:13,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:28:13,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:28:13,628 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 100 treesize of output 91 [2024-11-28 04:28:13,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:28:13,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:28:13,639 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 45 treesize of output 40 [2024-11-28 04:28:13,643 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 31 treesize of output 25 [2024-11-28 04:28:13,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:28:13,657 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 57 treesize of output 22 [2024-11-28 04:28:15,766 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-28 04:28:15,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:28:16,165 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_ArrVal_646 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_646))) (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 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |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_648 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_648))) (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) 0)))) is different from false [2024-11-28 04:28:16,219 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_ArrVal_643 Int)) (or (forall ((v_ArrVal_646 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.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_ArrVal_643)) v_ArrVal_643 v_ArrVal_646))) (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_643))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ v_ArrVal_643 1)))) (forall ((v_ArrVal_643 Int)) (or (forall ((v_ArrVal_648 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_644 Int)) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.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| v_ArrVal_644)) v_ArrVal_643 v_ArrVal_648))) (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_1))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ v_ArrVal_643 1)))))) is different from false [2024-11-28 04:28:16,259 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:28:16,260 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:28:16,354 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-11-28 04:28:16,354 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-28 04:28:16,377 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:28:16,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:28:16,508 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-11-28 04:28:16,508 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 363 treesize of output 350 [2024-11-28 04:28:16,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:16,548 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 296 treesize of output 294 [2024-11-28 04:28:16,564 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 253 treesize of output 241 [2024-11-28 04:28:16,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:16,594 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 348 treesize of output 322 [2024-11-28 04:28:16,613 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 289 treesize of output 277 [2024-11-28 04:28:16,649 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-28 04:28:17,668 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-28 04:28:17,705 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:28:17,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:17,720 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 68 treesize of output 74 [2024-11-28 04:28:17,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 17 treesize of output 9 [2024-11-28 04:28:17,930 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-28 04:28:17,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678544132] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:28:17,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:28:17,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 23 [2024-11-28 04:28:17,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722796202] [2024-11-28 04:28:17,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:28:17,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 04:28:17,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:28:17,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 04:28:17,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=364, Unknown=2, NotChecked=78, Total=506 [2024-11-28 04:28:17,932 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand has 23 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 22 states have internal predecessors, (93), 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-28 04:28:21,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:28:21,153 INFO L93 Difference]: Finished difference Result 358 states and 485 transitions. [2024-11-28 04:28:21,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 04:28:21,154 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 22 states have internal predecessors, (93), 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 76 [2024-11-28 04:28:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:28:21,156 INFO L225 Difference]: With dead ends: 358 [2024-11-28 04:28:21,156 INFO L226 Difference]: Without dead ends: 273 [2024-11-28 04:28:21,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 127 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=147, Invalid=981, Unknown=2, NotChecked=130, Total=1260 [2024-11-28 04:28:21,158 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 74 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 325 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:28:21,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1310 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 799 Invalid, 0 Unknown, 325 Unchecked, 2.5s Time] [2024-11-28 04:28:21,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-28 04:28:21,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 261. [2024-11-28 04:28:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 195 states have (on average 1.2717948717948717) internal successors, (248), 206 states have internal predecessors, (248), 41 states have call successors, (41), 16 states have call predecessors, (41), 24 states have return successors, (56), 38 states have call predecessors, (56), 38 states have call successors, (56) [2024-11-28 04:28:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 345 transitions. [2024-11-28 04:28:21,198 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 345 transitions. Word has length 76 [2024-11-28 04:28:21,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:28:21,198 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 345 transitions. [2024-11-28 04:28:21,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 22 states have internal predecessors, (93), 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-28 04:28:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 345 transitions. [2024-11-28 04:28:21,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 04:28:21,200 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:28:21,201 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2024-11-28 04:28:21,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 04:28:21,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:28:21,401 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:28:21,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:28:21,402 INFO L85 PathProgramCache]: Analyzing trace with hash -219961707, now seen corresponding path program 1 times [2024-11-28 04:28:21,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:28:21,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599444433] [2024-11-28 04:28:21,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:28:21,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:28:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:28:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-28 04:28:21,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:28:21,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599444433] [2024-11-28 04:28:21,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599444433] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:28:21,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993247462] [2024-11-28 04:28:21,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:28:21,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:28:21,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:28:21,570 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:28:21,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:28:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:28:21,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 04:28:21,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:28:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 04:28:21,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:28:21,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993247462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:28:21,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:28:21,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2024-11-28 04:28:21,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958404676] [2024-11-28 04:28:21,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:28:21,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:28:21,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:28:21,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:28:21,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:28:21,884 INFO L87 Difference]: Start difference. First operand 261 states and 345 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-28 04:28:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:28:22,088 INFO L93 Difference]: Finished difference Result 485 states and 632 transitions. [2024-11-28 04:28:22,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:28:22,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 87 [2024-11-28 04:28:22,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:28:22,091 INFO L225 Difference]: With dead ends: 485 [2024-11-28 04:28:22,091 INFO L226 Difference]: Without dead ends: 190 [2024-11-28 04:28:22,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:28:22,096 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 109 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:28:22,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 288 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:28:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-28 04:28:22,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-28 04:28:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 135 states have (on average 1.2148148148148148) internal successors, (164), 140 states have internal predecessors, (164), 37 states have call successors, (37), 15 states have call predecessors, (37), 17 states have return successors, (40), 34 states have call predecessors, (40), 34 states have call successors, (40) [2024-11-28 04:28:22,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 241 transitions. [2024-11-28 04:28:22,128 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 241 transitions. Word has length 87 [2024-11-28 04:28:22,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:28:22,129 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 241 transitions. [2024-11-28 04:28:22,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-28 04:28:22,129 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 241 transitions. [2024-11-28 04:28:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-28 04:28:22,131 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:28:22,132 INFO L218 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, 1] [2024-11-28 04:28:22,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 04:28:22,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:28:22,333 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:28:22,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:28:22,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2123239013, now seen corresponding path program 1 times [2024-11-28 04:28:22,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:28:22,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724346565] [2024-11-28 04:28:22,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:28:22,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:28:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:28:22,831 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-28 04:28:22,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:28:22,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724346565] [2024-11-28 04:28:22,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724346565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:28:22,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158535715] [2024-11-28 04:28:22,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:28:22,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:28:22,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:28:22,835 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:28:22,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 04:28:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:28:23,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-11-28 04:28:23,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:28:23,247 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-28 04:28:23,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:28:23,261 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 16 treesize of output 11 [2024-11-28 04:28:23,269 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-28 04:28:23,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:28:23,275 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 16 treesize of output 11 [2024-11-28 04:28:23,365 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2024-11-28 04:28:23,366 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 95 treesize of output 101 [2024-11-28 04:28:23,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:28:23,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:28:23,375 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 24 treesize of output 21 [2024-11-28 04:28:23,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 72 treesize of output 58 [2024-11-28 04:28:23,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 18 [2024-11-28 04:28:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 17 refuted. 5 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:28:31,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:28:32,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:32,579 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 126 [2024-11-28 04:28:32,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:32,591 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 154 [2024-11-28 04:28:32,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:32,618 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 1309 treesize of output 1123 [2024-11-28 04:28:32,635 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 569 treesize of output 553 [2024-11-28 04:28:32,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:32,680 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 684 treesize of output 698 [2024-11-28 04:28:32,695 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 683 treesize of output 675 [2024-11-28 04:28:32,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:32,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 703 treesize of output 679 [2024-11-28 04:28:33,206 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 6 treesize of output 4 [2024-11-28 04:28:33,268 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 6 treesize of output 4 [2024-11-28 04:28:33,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:33,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 111 treesize of output 115 [2024-11-28 04:28:33,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:33,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 297 treesize of output 297 [2024-11-28 04:28:34,066 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-28 04:28:34,074 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 24 treesize of output 20 [2024-11-28 04:28:34,083 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 24 treesize of output 20 [2024-11-28 04:28:34,152 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-28 04:28:34,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:34,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 205 treesize of output 183 [2024-11-28 04:28:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-28 04:28:35,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158535715] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:28:35,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:28:35,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 28, 16] total 47 [2024-11-28 04:28:35,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934667234] [2024-11-28 04:28:35,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:28:35,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-28 04:28:35,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:28:35,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-28 04:28:35,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1890, Unknown=85, NotChecked=0, Total=2162 [2024-11-28 04:28:35,068 INFO L87 Difference]: Start difference. First operand 190 states and 241 transitions. Second operand has 47 states, 42 states have (on average 3.357142857142857) internal successors, (141), 41 states have internal predecessors, (141), 14 states have call successors, (26), 7 states have call predecessors, (26), 11 states have return successors, (25), 12 states have call predecessors, (25), 14 states have call successors, (25) [2024-11-28 04:29:02,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:29:02,974 INFO L93 Difference]: Finished difference Result 696 states and 982 transitions. [2024-11-28 04:29:02,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-11-28 04:29:02,975 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 42 states have (on average 3.357142857142857) internal successors, (141), 41 states have internal predecessors, (141), 14 states have call successors, (26), 7 states have call predecessors, (26), 11 states have return successors, (25), 12 states have call predecessors, (25), 14 states have call successors, (25) Word has length 89 [2024-11-28 04:29:02,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:29:02,978 INFO L225 Difference]: With dead ends: 696 [2024-11-28 04:29:02,978 INFO L226 Difference]: Without dead ends: 454 [2024-11-28 04:29:02,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5931 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=1871, Invalid=18956, Unknown=635, NotChecked=0, Total=21462 [2024-11-28 04:29:02,985 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 293 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 106 mSolverCounterUnsat, 1469 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 4682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 1469 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:29:02,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1916 Invalid, 4682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3107 Invalid, 1469 Unknown, 0 Unchecked, 12.6s Time] [2024-11-28 04:29:02,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-28 04:29:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 376. [2024-11-28 04:29:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 289 states have (on average 1.2698961937716262) internal successors, (367), 304 states have internal predecessors, (367), 51 states have call successors, (51), 23 states have call predecessors, (51), 35 states have return successors, (95), 48 states have call predecessors, (95), 48 states have call successors, (95) [2024-11-28 04:29:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 513 transitions. [2024-11-28 04:29:03,075 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 513 transitions. Word has length 89 [2024-11-28 04:29:03,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:29:03,076 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 513 transitions. [2024-11-28 04:29:03,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 42 states have (on average 3.357142857142857) internal successors, (141), 41 states have internal predecessors, (141), 14 states have call successors, (26), 7 states have call predecessors, (26), 11 states have return successors, (25), 12 states have call predecessors, (25), 14 states have call successors, (25) [2024-11-28 04:29:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 513 transitions. [2024-11-28 04:29:03,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-28 04:29:03,081 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:29:03,081 INFO L218 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, 1, 1, 1] [2024-11-28 04:29:03,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 04:29:03,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-28 04:29:03,286 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:29:03,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:29:03,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1442601617, now seen corresponding path program 1 times [2024-11-28 04:29:03,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:29:03,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972785755] [2024-11-28 04:29:03,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:29:03,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:29:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:29:03,715 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-28 04:29:03,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:29:03,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972785755] [2024-11-28 04:29:03,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972785755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:29:03,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045363763] [2024-11-28 04:29:03,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:29:03,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:29:03,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:29:03,719 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:29:03,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 04:29:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:29:03,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-28 04:29:03,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:29:04,029 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-28 04:29:04,032 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-28 04:29:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:29:04,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:29:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-28 04:29:05,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045363763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:29:05,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:29:05,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 13] total 32 [2024-11-28 04:29:05,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850703110] [2024-11-28 04:29:05,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:29:05,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 04:29:05,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:29:05,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 04:29:05,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2024-11-28 04:29:05,548 INFO L87 Difference]: Start difference. First operand 376 states and 513 transitions. Second operand has 32 states, 30 states have (on average 4.433333333333334) internal successors, (133), 30 states have internal predecessors, (133), 11 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22) [2024-11-28 04:29:07,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:29:07,703 INFO L93 Difference]: Finished difference Result 1130 states and 1597 transitions. [2024-11-28 04:29:07,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-28 04:29:07,704 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 4.433333333333334) internal successors, (133), 30 states have internal predecessors, (133), 11 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22) Word has length 91 [2024-11-28 04:29:07,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:29:07,710 INFO L225 Difference]: With dead ends: 1130 [2024-11-28 04:29:07,711 INFO L226 Difference]: Without dead ends: 795 [2024-11-28 04:29:07,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=372, Invalid=2708, Unknown=0, NotChecked=0, Total=3080 [2024-11-28 04:29:07,714 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 319 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:29:07,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1242 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 04:29:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2024-11-28 04:29:07,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 668. [2024-11-28 04:29:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 513 states have (on average 1.2651072124756335) internal successors, (649), 540 states have internal predecessors, (649), 92 states have call successors, (92), 38 states have call predecessors, (92), 62 states have return successors, (157), 89 states have call predecessors, (157), 87 states have call successors, (157) [2024-11-28 04:29:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 898 transitions. [2024-11-28 04:29:07,830 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 898 transitions. Word has length 91 [2024-11-28 04:29:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:29:07,830 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 898 transitions. [2024-11-28 04:29:07,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 4.433333333333334) internal successors, (133), 30 states have internal predecessors, (133), 11 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22) [2024-11-28 04:29:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 898 transitions. [2024-11-28 04:29:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-28 04:29:07,833 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:29:07,834 INFO L218 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, 1, 1, 1] [2024-11-28 04:29:07,844 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 04:29:08,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-28 04:29:08,037 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:29:08,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:29:08,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1058687631, now seen corresponding path program 1 times [2024-11-28 04:29:08,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:29:08,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782647227] [2024-11-28 04:29:08,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:29:08,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:29:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:29:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-28 04:29:08,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:29:08,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782647227] [2024-11-28 04:29:08,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782647227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:29:08,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123724117] [2024-11-28 04:29:08,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:29:08,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:29:08,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:29:08,136 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:29:08,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 04:29:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:29:08,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:29:08,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:29:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-28 04:29:08,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:29:08,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123724117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:29:08,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:29:08,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-28 04:29:08,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413750350] [2024-11-28 04:29:08,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:29:08,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:29:08,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:29:08,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:29:08,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:29:08,419 INFO L87 Difference]: Start difference. First operand 668 states and 898 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-28 04:29:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:29:08,543 INFO L93 Difference]: Finished difference Result 1192 states and 1645 transitions. [2024-11-28 04:29:08,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:29:08,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 91 [2024-11-28 04:29:08,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:29:08,549 INFO L225 Difference]: With dead ends: 1192 [2024-11-28 04:29:08,549 INFO L226 Difference]: Without dead ends: 615 [2024-11-28 04:29:08,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 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-28 04:29:08,553 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:29:08,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:29:08,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-28 04:29:08,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2024-11-28 04:29:08,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 469 states have (on average 1.2302771855010661) internal successors, (577), 493 states have internal predecessors, (577), 86 states have call successors, (86), 38 states have call predecessors, (86), 59 states have return successors, (137), 83 states have call predecessors, (137), 81 states have call successors, (137) [2024-11-28 04:29:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 800 transitions. [2024-11-28 04:29:08,668 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 800 transitions. Word has length 91 [2024-11-28 04:29:08,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:29:08,669 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 800 transitions. [2024-11-28 04:29:08,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-28 04:29:08,669 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 800 transitions. [2024-11-28 04:29:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-28 04:29:08,672 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:29:08,672 INFO L218 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, 1, 1, 1] [2024-11-28 04:29:08,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 04:29:08,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-28 04:29:08,877 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:29:08,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:29:08,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1244925713, now seen corresponding path program 1 times [2024-11-28 04:29:08,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:29:08,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752102506] [2024-11-28 04:29:08,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:29:08,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:29:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:29:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-28 04:29:09,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:29:09,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752102506] [2024-11-28 04:29:09,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752102506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:29:09,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571928919] [2024-11-28 04:29:09,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:29:09,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:29:09,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:29:09,041 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:29:09,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 04:29:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:29:09,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:29:09,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:29:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-28 04:29:09,314 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:29:09,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571928919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:29:09,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:29:09,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-28 04:29:09,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694460664] [2024-11-28 04:29:09,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:29:09,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:29:09,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:29:09,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:29:09,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:29:09,316 INFO L87 Difference]: Start difference. First operand 615 states and 800 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-28 04:29:09,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:29:09,395 INFO L93 Difference]: Finished difference Result 862 states and 1169 transitions. [2024-11-28 04:29:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:29:09,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 91 [2024-11-28 04:29:09,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:29:09,398 INFO L225 Difference]: With dead ends: 862 [2024-11-28 04:29:09,398 INFO L226 Difference]: Without dead ends: 330 [2024-11-28 04:29:09,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:29:09,400 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:29:09,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 230 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:29:09,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-28 04:29:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2024-11-28 04:29:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 247 states have (on average 1.165991902834008) internal successors, (288), 258 states have internal predecessors, (288), 48 states have call successors, (48), 23 states have call predecessors, (48), 31 states have return successors, (71), 45 states have call predecessors, (71), 45 states have call successors, (71) [2024-11-28 04:29:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 407 transitions. [2024-11-28 04:29:09,461 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 407 transitions. Word has length 91 [2024-11-28 04:29:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:29:09,461 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 407 transitions. [2024-11-28 04:29:09,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-28 04:29:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 407 transitions. [2024-11-28 04:29:09,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-28 04:29:09,463 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:29:09,464 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:29:09,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 04:29:09,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 04:29:09,668 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:29:09,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:29:09,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1212899100, now seen corresponding path program 1 times [2024-11-28 04:29:09,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:29:09,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577337569] [2024-11-28 04:29:09,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:29:09,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:29:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:29:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-28 04:29:09,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:29:09,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577337569] [2024-11-28 04:29:09,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577337569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:29:09,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476755656] [2024-11-28 04:29:09,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:29:09,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:29:09,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:29:09,987 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:29:09,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 04:29:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:29:10,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-28 04:29:10,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:29:10,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:29:10,357 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 21 treesize of output 1 [2024-11-28 04:29:10,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:29:10,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:29:10,363 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 22 treesize of output 22 [2024-11-28 04:29:10,369 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 12 treesize of output 1 [2024-11-28 04:29:14,391 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (<= (+ (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_51|) 24) 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_51|)) is different from true [2024-11-28 04:29:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-28 04:29:39,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:30:02,932 INFO L349 Elim1Store]: treesize reduction 63, result has 62.0 percent of original size [2024-11-28 04:30:02,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 2782 treesize of output 2653 [2024-11-28 04:30:03,014 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 6561 treesize of output 6313 [2024-11-28 04:30:03,135 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 1947 treesize of output 1921 [2024-11-28 04:30:03,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 1921 treesize of output 1869 [2024-11-28 04:30:03,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:30:03,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2295 treesize of output 2191 [2024-11-28 04:30:08,163 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:30:08,227 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 5 treesize of output 3 [2024-11-28 04:30:08,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:30:08,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 8 [2024-11-28 04:30:08,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:30:08,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 52 [2024-11-28 04:30:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-28 04:30:08,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476755656] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:30:08,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:30:08,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 18] total 35 [2024-11-28 04:30:08,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381528232] [2024-11-28 04:30:08,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:30:08,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 04:30:08,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:30:08,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 04:30:08,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1015, Unknown=12, NotChecked=64, Total=1190 [2024-11-28 04:30:08,523 INFO L87 Difference]: Start difference. First operand 327 states and 407 transitions. Second operand has 35 states, 33 states have (on average 4.181818181818182) internal successors, (138), 30 states have internal predecessors, (138), 11 states have call successors, (29), 4 states have call predecessors, (29), 8 states have return successors, (27), 8 states have call predecessors, (27), 10 states have call successors, (27) [2024-11-28 04:30:12,543 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-28 04:30:16,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 04:30:20,674 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-28 04:30:24,677 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-28 04:30:33,117 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-28 04:30:37,997 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-28 04:30:42,701 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, 1] [2024-11-28 04:30:46,748 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, 1] [2024-11-28 04:30:54,868 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, 1] [2024-11-28 04:30:58,922 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, 1] [2024-11-28 04:31:04,499 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-28 04:31:09,189 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-28 04:31:13,266 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-28 04:31:17,293 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-28 04:31:21,296 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-28 04:31:22,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:31:22,785 INFO L93 Difference]: Finished difference Result 684 states and 851 transitions. [2024-11-28 04:31:22,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-28 04:31:22,786 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 4.181818181818182) internal successors, (138), 30 states have internal predecessors, (138), 11 states have call successors, (29), 4 states have call predecessors, (29), 8 states have return successors, (27), 8 states have call predecessors, (27), 10 states have call successors, (27) Word has length 92 [2024-11-28 04:31:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:31:22,789 INFO L225 Difference]: With dead ends: 684 [2024-11-28 04:31:22,789 INFO L226 Difference]: Without dead ends: 396 [2024-11-28 04:31:22,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 60.8s TimeCoverageRelationStatistics Valid=181, Invalid=1880, Unknown=13, NotChecked=88, Total=2162 [2024-11-28 04:31:22,792 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 59 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 1980 mSolverCounterSat, 14 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 2266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1980 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 64.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:31:22,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1733 Invalid, 2266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1980 Invalid, 15 Unknown, 257 Unchecked, 64.7s Time] [2024-11-28 04:31:22,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-28 04:31:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 349. [2024-11-28 04:31:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 271 states have (on average 1.1771217712177122) internal successors, (319), 281 states have internal predecessors, (319), 46 states have call successors, (46), 24 states have call predecessors, (46), 31 states have return successors, (61), 43 states have call predecessors, (61), 43 states have call successors, (61) [2024-11-28 04:31:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 426 transitions. [2024-11-28 04:31:22,890 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 426 transitions. Word has length 92 [2024-11-28 04:31:22,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:31:22,890 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 426 transitions. [2024-11-28 04:31:22,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 4.181818181818182) internal successors, (138), 30 states have internal predecessors, (138), 11 states have call successors, (29), 4 states have call predecessors, (29), 8 states have return successors, (27), 8 states have call predecessors, (27), 10 states have call successors, (27) [2024-11-28 04:31:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 426 transitions. [2024-11-28 04:31:22,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 04:31:22,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:31:22,892 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:31:22,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 04:31:23,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 04:31:23,093 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:31:23,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:31:23,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1497628778, now seen corresponding path program 1 times [2024-11-28 04:31:23,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:31:23,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827099498] [2024-11-28 04:31:23,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:31:23,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:31:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:31:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-28 04:31:23,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:31:23,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827099498] [2024-11-28 04:31:23,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827099498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:31:23,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:31:23,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 04:31:23,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693597277] [2024-11-28 04:31:23,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:31:23,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:31:23,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:31:23,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:31:23,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:31:23,551 INFO L87 Difference]: Start difference. First operand 349 states and 426 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 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-28 04:31:23,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:31:23,716 INFO L93 Difference]: Finished difference Result 375 states and 455 transitions. [2024-11-28 04:31:23,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:31:23,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 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 110 [2024-11-28 04:31:23,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:31:23,720 INFO L225 Difference]: With dead ends: 375 [2024-11-28 04:31:23,720 INFO L226 Difference]: Without dead ends: 373 [2024-11-28 04:31:23,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-28 04:31:23,721 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:31:23,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 452 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:31:23,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-28 04:31:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 355. [2024-11-28 04:31:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 275 states have (on average 1.1745454545454546) internal successors, (323), 285 states have internal predecessors, (323), 47 states have call successors, (47), 25 states have call predecessors, (47), 32 states have return successors, (62), 44 states have call predecessors, (62), 44 states have call successors, (62) [2024-11-28 04:31:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 432 transitions. [2024-11-28 04:31:23,807 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 432 transitions. Word has length 110 [2024-11-28 04:31:23,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:31:23,807 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 432 transitions. [2024-11-28 04:31:23,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 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-28 04:31:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 432 transitions. [2024-11-28 04:31:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-28 04:31:23,809 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:31:23,809 INFO L218 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-28 04:31:23,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 04:31:23,809 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:31:23,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:31:23,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1886091741, now seen corresponding path program 2 times [2024-11-28 04:31:23,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:31:23,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032473136] [2024-11-28 04:31:23,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:31:23,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:31:23,862 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:31:23,862 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:31:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-28 04:31:24,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:31:24,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032473136] [2024-11-28 04:31:24,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032473136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:31:24,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106643606] [2024-11-28 04:31:24,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:31:24,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:31:24,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:31:24,246 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:31:24,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 04:31:24,567 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:31:24,568 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:31:24,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-28 04:31:24,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:31:24,679 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 9 treesize of output 8 [2024-11-28 04:31:24,681 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 8 treesize of output 7 [2024-11-28 04:31:24,686 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 04:31:24,691 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-28 04:31:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-28 04:31:25,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:31:25,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106643606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:31:25,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:31:25,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [7] total 19 [2024-11-28 04:31:25,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781684835] [2024-11-28 04:31:25,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:31:25,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 04:31:25,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:31:25,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 04:31:25,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:31:25,591 INFO L87 Difference]: Start difference. First operand 355 states and 432 transitions. Second operand has 14 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 6 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-28 04:31:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:31:26,508 INFO L93 Difference]: Finished difference Result 413 states and 501 transitions. [2024-11-28 04:31:26,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:31:26,509 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 6 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 113 [2024-11-28 04:31:26,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:31:26,511 INFO L225 Difference]: With dead ends: 413 [2024-11-28 04:31:26,511 INFO L226 Difference]: Without dead ends: 357 [2024-11-28 04:31:26,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-28 04:31:26,513 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 32 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:31:26,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 666 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 04:31:26,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-28 04:31:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2024-11-28 04:31:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 275 states have (on average 1.1745454545454546) internal successors, (323), 285 states have internal predecessors, (323), 47 states have call successors, (47), 25 states have call predecessors, (47), 32 states have return successors, (61), 44 states have call predecessors, (61), 44 states have call successors, (61) [2024-11-28 04:31:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 431 transitions. [2024-11-28 04:31:26,588 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 431 transitions. Word has length 113 [2024-11-28 04:31:26,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:31:26,588 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 431 transitions. [2024-11-28 04:31:26,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 6 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-28 04:31:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 431 transitions. [2024-11-28 04:31:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-28 04:31:26,590 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:31:26,590 INFO L218 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-28 04:31:26,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 04:31:26,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:31:26,795 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:31:26,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:31:26,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1330556572, now seen corresponding path program 1 times [2024-11-28 04:31:26,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:31:26,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906755813] [2024-11-28 04:31:26,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:31:26,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:31:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 04:31:26,896 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 04:31:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 04:31:27,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 04:31:27,017 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 04:31:27,018 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 04:31:27,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 04:31:27,023 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:31:27,099 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 04:31:27,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:31:27 BoogieIcfgContainer [2024-11-28 04:31:27,104 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 04:31:27,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 04:31:27,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 04:31:27,105 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 04:31:27,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:26:09" (3/4) ... [2024-11-28 04:31:27,108 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 04:31:27,194 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 58. [2024-11-28 04:31:27,302 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 04:31:27,302 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 04:31:27,302 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 04:31:27,303 INFO L158 Benchmark]: Toolchain (without parser) took 320881.27ms. Allocated memory was 117.4MB in the beginning and 570.4MB in the end (delta: 453.0MB). Free memory was 87.5MB in the beginning and 275.6MB in the end (delta: -188.1MB). Peak memory consumption was 264.9MB. Max. memory is 16.1GB. [2024-11-28 04:31:27,303 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 167.8MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:31:27,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2392.25ms. Allocated memory is still 117.4MB. Free memory was 87.2MB in the beginning and 47.5MB in the end (delta: 39.7MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2024-11-28 04:31:27,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.14ms. Allocated memory is still 117.4MB. Free memory was 47.5MB in the beginning and 42.4MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:31:27,304 INFO L158 Benchmark]: Boogie Preprocessor took 100.10ms. Allocated memory is still 117.4MB. Free memory was 42.4MB in the beginning and 38.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:31:27,304 INFO L158 Benchmark]: RCFGBuilder took 664.84ms. Allocated memory is still 117.4MB. Free memory was 38.3MB in the beginning and 52.9MB in the end (delta: -14.6MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-11-28 04:31:27,304 INFO L158 Benchmark]: TraceAbstraction took 317412.82ms. Allocated memory was 117.4MB in the beginning and 570.4MB in the end (delta: 453.0MB). Free memory was 52.3MB in the beginning and 284.0MB in the end (delta: -231.7MB). Peak memory consumption was 216.8MB. Max. memory is 16.1GB. [2024-11-28 04:31:27,305 INFO L158 Benchmark]: Witness Printer took 198.01ms. Allocated memory is still 570.4MB. Free memory was 284.0MB in the beginning and 275.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:31:27,306 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44ms. Allocated memory is still 167.8MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2392.25ms. Allocated memory is still 117.4MB. Free memory was 87.2MB in the beginning and 47.5MB in the end (delta: 39.7MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.14ms. Allocated memory is still 117.4MB. Free memory was 47.5MB in the beginning and 42.4MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.10ms. Allocated memory is still 117.4MB. Free memory was 42.4MB in the beginning and 38.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 664.84ms. Allocated memory is still 117.4MB. Free memory was 38.3MB in the beginning and 52.9MB in the end (delta: -14.6MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * TraceAbstraction took 317412.82ms. Allocated memory was 117.4MB in the beginning and 570.4MB in the end (delta: 453.0MB). Free memory was 52.3MB in the beginning and 284.0MB in the end (delta: -231.7MB). Peak memory consumption was 216.8MB. Max. memory is 16.1GB. * Witness Printer took 198.01ms. Allocated memory is still 570.4MB. Free memory was 284.0MB in the beginning and 275.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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=-((__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=-((__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, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 317.3s, OverallIterations: 20, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 142.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1488 mSolverCounterUnknown, 1658 SdHoareTripleChecker+Valid, 101.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1564 mSDsluCounter, 11806 SdHoareTripleChecker+Invalid, 99.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 582 IncrementalHoareTripleChecker+Unchecked, 10325 mSDsCounter, 496 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9377 IncrementalHoareTripleChecker+Invalid, 11943 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 496 mSolverCounterUnsat, 1481 mSDtfsCounter, 9377 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 1488 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1892 GetRequests, 1397 SyntacticMatches, 37 SemanticMatches, 458 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 7429 ImplicationChecksByTransitivity, 173.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=668occurred in iteration=14, InterpolantAutomatonStates: 336, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 343 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 166.3s InterpolantComputationTime, 2821 NumberOfCodeBlocks, 2821 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3083 ConstructedInterpolants, 384 QuantifiedInterpolants, 48398 SizeOfPredicates, 75 NumberOfNonLiveVariables, 5252 ConjunctsInSsa, 609 ConjunctsInUnsatCore, 38 InterpolantComputations, 15 PerfectInterpolantSequences, 1701/1940 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-28 04:31:27,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_279d0164-38ff-4154-bd6d-6b94ca3482d1/bin/uautomizer-verify-aQ6SnzHsRB/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