./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.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_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1 --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 0a45241a50bca97d16f2ca30787e76783488e633dbd3fde1131a60622cf8ee85 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 13:58:45,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 13:58:45,512 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-12-02 13:58:45,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 13:58:45,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 13:58:45,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 13:58:45,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 13:58:45,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 13:58:45,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 13:58:45,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 13:58:45,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 13:58:45,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 13:58:45,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 13:58:45,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 13:58:45,540 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 13:58:45,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 13:58:45,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 13:58:45,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 13:58:45,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 13:58:45,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 13:58:45,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 13:58:45,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 13:58:45,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 13:58:45,541 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 13:58:45,541 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 13:58:45,541 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 13:58:45,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:58:45,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 13:58:45,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:58:45,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:58:45,542 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 13:58:45,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:58:45,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 13:58:45,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:58:45,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:58:45,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 13:58:45,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 13:58:45,543 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 13:58:45,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 13:58:45,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 13:58:45,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 13:58:45,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 13:58:45,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 13:58:45,543 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 13:58:45,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 13:58:45,543 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_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1 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 -> 0a45241a50bca97d16f2ca30787e76783488e633dbd3fde1131a60622cf8ee85 [2024-12-02 13:58:45,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 13:58:45,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 13:58:45,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 13:58:45,774 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 13:58:45,774 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 13:58:45,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i [2024-12-02 13:58:48,645 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/data/718034b6c/07e35f66fef94516a417355f1664c1d6/FLAGa57b522e1 [2024-12-02 13:58:49,016 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 13:58:49,017 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i [2024-12-02 13:58:49,041 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/data/718034b6c/07e35f66fef94516a417355f1664c1d6/FLAGa57b522e1 [2024-12-02 13:58:49,055 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/data/718034b6c/07e35f66fef94516a417355f1664c1d6 [2024-12-02 13:58:49,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 13:58:49,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 13:58:49,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 13:58:49,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 13:58:49,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 13:58:49,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:58:49" (1/1) ... [2024-12-02 13:58:49,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c35b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:49, skipping insertion in model container [2024-12-02 13:58:49,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:58:49" (1/1) ... [2024-12-02 13:58:49,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 13:58:49,326 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_3cda489a-0cc8-4c9c-92f6-368343601e29/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i[4499,4512] [2024-12-02 13:58:49,331 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_3cda489a-0cc8-4c9c-92f6-368343601e29/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i[4559,4572] [2024-12-02 13:58:50,100 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,101 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,101 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,102 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,103 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,118 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,119 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,121 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,122 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,125 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,126 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,127 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,127 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,748 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_3cda489a-0cc8-4c9c-92f6-368343601e29/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i[150662,150675] [2024-12-02 13:58:50,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:58:50,764 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 13:58:50,776 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_3cda489a-0cc8-4c9c-92f6-368343601e29/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i[4499,4512] [2024-12-02 13:58:50,777 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_3cda489a-0cc8-4c9c-92f6-368343601e29/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i[4559,4572] [2024-12-02 13:58:50,845 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,845 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,846 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,846 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,847 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,855 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,855 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,856 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,857 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,858 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,858 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,859 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,859 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 13:58:50,936 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_3cda489a-0cc8-4c9c-92f6-368343601e29/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i[150662,150675] [2024-12-02 13:58:50,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:58:51,098 INFO L204 MainTranslator]: Completed translation [2024-12-02 13:58:51,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:51 WrapperNode [2024-12-02 13:58:51,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 13:58:51,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 13:58:51,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 13:58:51,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 13:58:51,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:51" (1/1) ... [2024-12-02 13:58:51,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:51" (1/1) ... [2024-12-02 13:58:51,189 INFO L138 Inliner]: procedures = 668, calls = 1044, calls flagged for inlining = 53, calls inlined = 8, statements flattened = 223 [2024-12-02 13:58:51,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 13:58:51,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 13:58:51,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 13:58:51,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 13:58:51,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:51" (1/1) ... [2024-12-02 13:58:51,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:51" (1/1) ... [2024-12-02 13:58:51,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:51" (1/1) ... [2024-12-02 13:58:51,233 INFO L175 MemorySlicer]: Split 43 memory accesses to 3 slices as follows [2, 36, 5]. 84 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 9 writes are split as follows [0, 9, 0]. [2024-12-02 13:58:51,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:51" (1/1) ... [2024-12-02 13:58:51,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:51" (1/1) ... [2024-12-02 13:58:51,249 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:51" (1/1) ... [2024-12-02 13:58:51,251 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:51" (1/1) ... [2024-12-02 13:58:51,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:51" (1/1) ... [2024-12-02 13:58:51,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:51" (1/1) ... [2024-12-02 13:58:51,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:51" (1/1) ... [2024-12-02 13:58:51,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 13:58:51,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 13:58:51,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 13:58:51,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 13:58:51,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:51" (1/1) ... [2024-12-02 13:58:51,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:58:51,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:58:51,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 13:58:51,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 13:58:51,322 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2024-12-02 13:58:51,322 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2024-12-02 13:58:51,322 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2024-12-02 13:58:51,322 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2024-12-02 13:58:51,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-02 13:58:51,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-12-02 13:58:51,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-12-02 13:58:51,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-12-02 13:58:51,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-12-02 13:58:51,322 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-12-02 13:58:51,323 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-12-02 13:58:51,323 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-12-02 13:58:51,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 13:58:51,323 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-12-02 13:58:51,323 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-12-02 13:58:51,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 13:58:51,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-12-02 13:58:51,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-12-02 13:58:51,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-12-02 13:58:51,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 13:58:51,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 13:58:51,323 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2024-12-02 13:58:51,323 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2024-12-02 13:58:51,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-12-02 13:58:51,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-12-02 13:58:51,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-12-02 13:58:51,324 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-12-02 13:58:51,324 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-12-02 13:58:51,324 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-12-02 13:58:51,324 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-02 13:58:51,324 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-02 13:58:51,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-02 13:58:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-12-02 13:58:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-12-02 13:58:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-12-02 13:58:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-12-02 13:58:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-12-02 13:58:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-12-02 13:58:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-12-02 13:58:51,325 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-12-02 13:58:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2024-12-02 13:58:51,325 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2024-12-02 13:58:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 13:58:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 13:58:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-12-02 13:58:51,562 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 13:58:51,564 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 13:58:52,004 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-12-02 13:58:52,004 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 13:58:52,015 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 13:58:52,016 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-12-02 13:58:52,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:58:52 BoogieIcfgContainer [2024-12-02 13:58:52,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 13:58:52,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 13:58:52,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 13:58:52,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 13:58:52,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:58:49" (1/3) ... [2024-12-02 13:58:52,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7789bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:58:52, skipping insertion in model container [2024-12-02 13:58:52,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:51" (2/3) ... [2024-12-02 13:58:52,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7789bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:58:52, skipping insertion in model container [2024-12-02 13:58:52,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:58:52" (3/3) ... [2024-12-02 13:58:52,027 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_front_harness.i [2024-12-02 13:58:52,040 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 13:58:52,041 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_pop_front_harness.i that has 13 procedures, 145 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2024-12-02 13:58:52,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 13:58:52,102 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;@50a7501a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 13:58:52,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 13:58:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 89 states have (on average 1.303370786516854) internal successors, (116), 90 states have internal predecessors, (116), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-12-02 13:58:52,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-02 13:58:52,115 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:58:52,116 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:58:52,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:58:52,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:58:52,121 INFO L85 PathProgramCache]: Analyzing trace with hash -629864822, now seen corresponding path program 1 times [2024-12-02 13:58:52,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:58:52,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414730531] [2024-12-02 13:58:52,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:58:52,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:58:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:58:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-12-02 13:58:52,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:58:52,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414730531] [2024-12-02 13:58:52,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414730531] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:58:52,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238983989] [2024-12-02 13:58:52,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:58:52,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:58:52,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:58:52,470 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:58:52,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 13:58:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:58:52,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-12-02 13:58:52,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:58:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-12-02 13:58:52,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 13:58:52,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238983989] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:58:52,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 13:58:52,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-12-02 13:58:52,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249081011] [2024-12-02 13:58:52,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:58:52,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 13:58:52,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:58:52,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 13:58:52,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 13:58:52,785 INFO L87 Difference]: Start difference. First operand has 137 states, 89 states have (on average 1.303370786516854) internal successors, (116), 90 states have internal predecessors, (116), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-12-02 13:58:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:58:52,826 INFO L93 Difference]: Finished difference Result 266 states and 401 transitions. [2024-12-02 13:58:52,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 13:58:52,828 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-12-02 13:58:52,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:58:52,836 INFO L225 Difference]: With dead ends: 266 [2024-12-02 13:58:52,836 INFO L226 Difference]: Without dead ends: 132 [2024-12-02 13:58:52,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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-12-02 13:58:52,843 INFO L435 NwaCegarLoop]: 183 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, 183 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-12-02 13:58:52,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:58:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-12-02 13:58:52,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-12-02 13:58:52,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 84 states have (on average 1.25) internal successors, (105), 85 states have internal predecessors, (105), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-12-02 13:58:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 178 transitions. [2024-12-02 13:58:52,894 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 178 transitions. Word has length 116 [2024-12-02 13:58:52,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:58:52,895 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 178 transitions. [2024-12-02 13:58:52,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-12-02 13:58:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 178 transitions. [2024-12-02 13:58:52,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-02 13:58:52,899 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:58:52,899 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:58:52,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 13:58:53,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-12-02 13:58:53,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:58:53,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:58:53,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1855713404, now seen corresponding path program 1 times [2024-12-02 13:58:53,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:58:53,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148685851] [2024-12-02 13:58:53,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:58:53,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:58:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:58:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-12-02 13:58:53,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:58:53,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148685851] [2024-12-02 13:58:53,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148685851] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:58:53,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026694415] [2024-12-02 13:58:53,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:58:53,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:58:53,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:58:53,801 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:58:53,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 13:58:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:58:54,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-12-02 13:58:54,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:58:54,275 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 22 treesize of output 1 [2024-12-02 13:58:54,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-12-02 13:58:54,302 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-12-02 13:58:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-12-02 13:58:56,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 13:58:56,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026694415] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:58:56,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 13:58:56,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2024-12-02 13:58:56,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135188523] [2024-12-02 13:58:56,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:58:56,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 13:58:56,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:58:56,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 13:58:56,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-12-02 13:58:56,127 INFO L87 Difference]: Start difference. First operand 132 states and 178 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2024-12-02 13:59:00,133 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-12-02 13:59:04,193 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-12-02 13:59:08,230 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-12-02 13:59:12,301 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-12-02 13:59:16,306 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-12-02 13:59:21,352 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-12-02 13:59:25,401 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-12-02 13:59:29,414 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-12-02 13:59:29,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:59:29,479 INFO L93 Difference]: Finished difference Result 344 states and 473 transitions. [2024-12-02 13:59:29,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 13:59:29,480 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 116 [2024-12-02 13:59:29,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:59:29,483 INFO L225 Difference]: With dead ends: 344 [2024-12-02 13:59:29,483 INFO L226 Difference]: Without dead ends: 220 [2024-12-02 13:59:29,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 87 SyntacticMatches, 20 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2024-12-02 13:59:29,485 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 380 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 115 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:59:29,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 761 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 472 Invalid, 8 Unknown, 0 Unchecked, 33.0s Time] [2024-12-02 13:59:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-12-02 13:59:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 214. [2024-12-02 13:59:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 139 states have internal predecessors, (173), 60 states have call successors, (60), 17 states have call predecessors, (60), 16 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2024-12-02 13:59:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 292 transitions. [2024-12-02 13:59:29,515 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 292 transitions. Word has length 116 [2024-12-02 13:59:29,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:59:29,516 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 292 transitions. [2024-12-02 13:59:29,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2024-12-02 13:59:29,516 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 292 transitions. [2024-12-02 13:59:29,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-02 13:59:29,519 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:59:29,519 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:59:29,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 13:59:29,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:59:29,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:59:29,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:59:29,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2079877694, now seen corresponding path program 1 times [2024-12-02 13:59:29,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:59:29,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732832118] [2024-12-02 13:59:29,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:59:29,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:59:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:59:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-12-02 13:59:30,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:59:30,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732832118] [2024-12-02 13:59:30,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732832118] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:59:30,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343288007] [2024-12-02 13:59:30,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:59:30,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:59:30,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:59:30,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:59:30,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 13:59:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:59:30,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-12-02 13:59:30,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:59:30,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-12-02 13:59:30,499 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 22 treesize of output 7 [2024-12-02 13:59:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 79 proven. 28 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-12-02 13:59:33,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:59:46,120 INFO L349 Elim1Store]: treesize reduction 17, result has 63.0 percent of original size [2024-12-02 13:59:46,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 98 [2024-12-02 13:59:46,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:59:46,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 98 treesize of output 114 [2024-12-02 13:59:46,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-12-02 13:59:46,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-12-02 13:59:46,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-12-02 13:59:46,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:59:46,260 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 1 case distinctions, treesize of input 25 treesize of output 29 [2024-12-02 13:59:46,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:59:46,285 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 1 case distinctions, treesize of input 43 treesize of output 47 [2024-12-02 13:59:46,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 13:59:46,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:59:46,350 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 20 treesize of output 21 [2024-12-02 13:59:46,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:59:46,361 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 21 treesize of output 25 [2024-12-02 13:59:46,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 13:59:46,393 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-12-02 13:59:46,394 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 1 case distinctions, treesize of input 33 treesize of output 32 [2024-12-02 13:59:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-02 13:59:46,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343288007] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 13:59:46,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-02 13:59:46,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [6, 17] total 34 [2024-12-02 13:59:46,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145466800] [2024-12-02 13:59:46,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:59:46,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 13:59:46,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:59:46,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 13:59:46,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1012, Unknown=3, NotChecked=0, Total=1122 [2024-12-02 13:59:46,534 INFO L87 Difference]: Start difference. First operand 214 states and 292 transitions. Second operand has 17 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2024-12-02 13:59:47,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:59:47,477 INFO L93 Difference]: Finished difference Result 321 states and 430 transitions. [2024-12-02 13:59:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 13:59:47,478 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 116 [2024-12-02 13:59:47,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:59:47,479 INFO L225 Difference]: With dead ends: 321 [2024-12-02 13:59:47,480 INFO L226 Difference]: Without dead ends: 134 [2024-12-02 13:59:47,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 188 SyntacticMatches, 16 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=125, Invalid=1204, Unknown=3, NotChecked=0, Total=1332 [2024-12-02 13:59:47,481 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 11 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 13:59:47,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1937 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 13:59:47,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-12-02 13:59:47,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2024-12-02 13:59:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 86 states have internal predecessors, (106), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-12-02 13:59:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 179 transitions. [2024-12-02 13:59:47,495 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 179 transitions. Word has length 116 [2024-12-02 13:59:47,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:59:47,495 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 179 transitions. [2024-12-02 13:59:47,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2024-12-02 13:59:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 179 transitions. [2024-12-02 13:59:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-02 13:59:47,497 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:59:47,497 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:59:47,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 13:59:47,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:59:47,698 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:59:47,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:59:47,698 INFO L85 PathProgramCache]: Analyzing trace with hash 317487032, now seen corresponding path program 1 times [2024-12-02 13:59:47,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:59:47,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568909788] [2024-12-02 13:59:47,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:59:47,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:59:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:59:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-12-02 13:59:48,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:59:48,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568909788] [2024-12-02 13:59:48,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568909788] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:59:48,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165505844] [2024-12-02 13:59:48,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:59:48,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:59:48,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:59:48,179 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:59:48,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 13:59:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:59:48,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-12-02 13:59:48,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:59:48,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2024-12-02 13:59:48,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 13:59:48,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-12-02 13:59:48,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2024-12-02 13:59:48,493 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 1 [2024-12-02 13:59:48,582 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse1 (select .cse0 .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse2 .cse1))) (not (= .cse1 0))))))) is different from true [2024-12-02 13:59:48,813 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse1 (select .cse0 .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse2 .cse1))) (not (= .cse1 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse5 .cse4))) (not (= .cse4 0)))))))) is different from true [2024-12-02 13:59:48,950 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse1 (select .cse0 .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse2 .cse1))) (not (= .cse1 0))))))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset| 24))) (let ((.cse3 (select .cse5 .cse4))) (or (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse4 .cse3) .cse5)) (not (= .cse3 0))) (and (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| 0)) (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| .cse3))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse8 .cse7))) (not (= .cse7 0)))))))) is different from true [2024-12-02 13:59:49,008 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse1 (select .cse0 .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse2 .cse1))) (not (= .cse1 0))))))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (.cse4 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse3 (select .cse5 .cse4))) (or (and (not (= .cse3 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse4 .cse3) .cse5))) (and (= .cse3 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse8 .cse7))) (not (= .cse7 0)))))))) is different from true [2024-12-02 13:59:49,064 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse1 (select .cse0 .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse2 .cse1))) (not (= .cse1 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) .cse5 .cse4))) (not (= .cse4 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse8 .cse7))) (not (= .cse7 0)))))))) is different from true [2024-12-02 13:59:49,670 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse5 .cse4))) (not (= .cse4 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) .cse8 .cse7))) (not (= .cse7 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse10 (select .cse9 .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse11 .cse10))) (not (= .cse10 0)))))))) is different from true [2024-12-02 13:59:50,204 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse5 .cse4))) (not (= .cse4 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) .cse8 .cse7))) (not (= .cse7 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|)) (.cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse9 (select .cse11 .cse10))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) .cse10 .cse9) .cse11)) (not (= .cse9 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse13 (select .cse12 .cse14))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse14 .cse13))) (not (= .cse13 0)))))))) is different from true [2024-12-02 13:59:51,128 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse5 .cse4))) (not (= .cse4 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) .cse8 .cse7))) (not (= .cse7 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|)) (.cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse9 (select .cse11 .cse10))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) .cse10 .cse9) .cse11)) (not (= .cse9 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse12 (select .cse13 .cse14))) (and (not (= .cse12 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse13 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|) .cse14 .cse12)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse16 (select .cse15 .cse17))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse15 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse16 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse17 .cse16))) (not (= .cse16 0)))))))) is different from true [2024-12-02 13:59:51,470 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse5 .cse4))) (not (= .cse4 0))))))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (.cse7 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse6 (select .cse8 .cse7))) (or (and (not (= .cse6 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse7 .cse6) .cse8))) (and (= .cse6 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|)) (.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse10 (select .cse9 .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) .cse11 .cse10))) (not (= .cse10 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse12 (select .cse14 .cse13))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) .cse13 .cse12) .cse14)) (not (= .cse12 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| Int)) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse15 (select .cse16 .cse17))) (and (not (= .cse15 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse16 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse15 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|) .cse17 .cse15)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse19 (select .cse18 .cse20))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse18 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse19 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse20 .cse19))) (not (= .cse19 0)))))))) is different from true [2024-12-02 13:59:51,583 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse5 .cse4))) (not (= .cse4 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) .cse8 .cse7))) (not (= .cse7 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|)) (.cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse9 (select .cse11 .cse10))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) .cse10 .cse9) .cse11)) (not (= .cse9 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse12 (select .cse13 .cse14))) (and (not (= .cse12 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse13 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|) .cse14 .cse12)))))))) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_front_~list#1.base|)) (.cse17 (+ |c_ULTIMATE.start_aws_linked_list_front_~list#1.offset| 24))) (let ((.cse15 (select .cse16 .cse17))) (or (and (not (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| 0)) (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| .cse15)) (and (not (= 0 .cse15)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse16 (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| v_DerPreprocessor_1) .cse15 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_front_~list#1.base|) .cse17 .cse15))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse19 (select .cse18 .cse20))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse18 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse19 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse20 .cse19))) (not (= .cse19 0)))))))) is different from true [2024-12-02 13:59:51,663 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_12| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12|) .cse4 .cse3) .cse5)) (not (= .cse3 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse8 .cse7))) (not (= .cse7 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|)) (.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse10 (select .cse9 .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) .cse11 .cse10))) (not (= .cse10 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse12 (select .cse14 .cse13))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) .cse13 .cse12) .cse14)) (not (= .cse12 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| Int)) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse15 (select .cse16 .cse17))) (and (not (= .cse15 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse16 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse15 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|) .cse17 .cse15)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse19 (select .cse18 .cse20))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse18 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse19 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse20 .cse19))) (not (= .cse19 0)))))))) is different from true [2024-12-02 13:59:51,788 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_12| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12|) .cse4 .cse3) .cse5)) (not (= .cse3 0))))))) (= |c_aws_linked_list_is_valid_~list#1.offset| |c_aws_linked_list_is_valid_#in~list#1.offset|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse8 .cse7))) (not (= .cse7 0))))))) (= |c_aws_linked_list_is_valid_~list#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|)) (.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse10 (select .cse9 .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) .cse11 .cse10))) (not (= .cse10 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse12 (select .cse14 .cse13))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) .cse13 .cse12) .cse14)) (not (= .cse12 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| Int)) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse15 (select .cse16 .cse17))) (and (not (= .cse15 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse16 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse15 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|) .cse17 .cse15)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse19 (select .cse18 .cse20))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse18 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse19 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse20 .cse19))) (not (= .cse19 0)))))))) is different from true [2024-12-02 13:59:52,277 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_12| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_12|) .cse4 .cse3) .cse5)) (not (= .cse3 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse8 .cse7))) (not (= .cse7 0))))))) (or (= (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 0) |c_aws_linked_list_is_valid_#t~short308#1|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|)) (.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse10 (select .cse9 .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) .cse11 .cse10))) (not (= .cse10 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse12 (select .cse14 .cse13))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) .cse13 .cse12) .cse14)) (not (= .cse12 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| Int)) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse15 (select .cse16 .cse17))) (and (not (= .cse15 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse16 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse15 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|) .cse17 .cse15)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse19 (select .cse18 .cse20))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse18 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse19 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse20 .cse19))) (not (= .cse19 0)))))))) is different from true [2024-12-02 13:59:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 56 not checked. [2024-12-02 13:59:53,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:59:53,887 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-12-02 13:59:53,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 185 [2024-12-02 13:59:53,893 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 72 treesize of output 68 [2024-12-02 13:59:53,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:59:53,901 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 91 treesize of output 93 [2024-12-02 13:59:53,945 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-12-02 13:59:53,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-12-02 13:59:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-12-02 13:59:53,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165505844] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:59:53,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:59:53,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 24, 11] total 35 [2024-12-02 13:59:53,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830894178] [2024-12-02 13:59:53,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:59:53,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-12-02 13:59:53,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:59:53,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-12-02 13:59:53,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=375, Unknown=53, NotChecked=676, Total=1190 [2024-12-02 13:59:53,989 INFO L87 Difference]: Start difference. First operand 133 states and 179 transitions. Second operand has 35 states, 28 states have (on average 4.392857142857143) internal successors, (123), 28 states have internal predecessors, (123), 16 states have call successors, (38), 9 states have call predecessors, (38), 12 states have return successors, (37), 14 states have call predecessors, (37), 16 states have call successors, (37) [2024-12-02 13:59:54,391 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse1 (select .cse0 .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse2 .cse1))) (not (= .cse1 0))))))) (not (= |c_assume_abort_if_not_#in~cond| 0)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse5 .cse4))) (not (= .cse4 0)))))))) is different from true [2024-12-02 13:59:54,404 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (.cse5 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse4 (select .cse6 .cse5))) (let ((.cse3 (not (= .cse4 0)))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse1 (select .cse0 .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse2 .cse1))) (not (= .cse1 0))))))) (or (and .cse3 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse5 .cse4) .cse6))) (and (= .cse4 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| 0)))) .cse3 (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse8 (select .cse7 .cse9))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse9 .cse8))) (not (= .cse8 0))))))))))) is different from true [2024-12-02 13:59:54,550 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse1 (select .cse0 .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse2 .cse1))) (not (= .cse1 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) .cse5 .cse4))) (not (= .cse4 0))))))) (not (= |c_assume_abort_if_not_#in~cond| 0)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse8 .cse7))) (not (= .cse7 0)))))))) is different from true [2024-12-02 13:59:54,574 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)))) (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse5 .cse4))) (not (= .cse4 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) .cse8 .cse7))) (not (= .cse7 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse10 (select .cse9 .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse11 .cse10))) (not (= .cse10 0)))))))) is different from true [2024-12-02 13:59:54,584 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse5 .cse4))) (not (= .cse4 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) .cse8 .cse7))) (not (= .cse7 0))))))) (not (= |c_assume_abort_if_not_#in~cond| 0)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse10 (select .cse9 .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse11 .cse10))) (not (= .cse10 0)))))))) is different from true [2024-12-02 13:59:54,656 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)))) (or (= (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 0) (not (= 0 (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_~list#1.base|) (+ |c_aws_linked_list_is_valid_~list#1.offset| 24))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse5 .cse4))) (not (= .cse4 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) .cse8 .cse7))) (not (= .cse7 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|)) (.cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse9 (select .cse11 .cse10))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) .cse10 .cse9) .cse11)) (not (= .cse9 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse13 (select .cse12 .cse14))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse14 .cse13))) (not (= .cse13 0)))))))) is different from true [2024-12-02 13:59:54,679 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse5 .cse4))) (not (= .cse4 0))))))) (or (= (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 0) |c_aws_linked_list_is_valid_#t~short308#1|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) .cse8 .cse7))) (not (= .cse7 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|)) (.cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse9 (select .cse11 .cse10))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) .cse10 .cse9) .cse11)) (not (= .cse9 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse13 (select .cse12 .cse14))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse14 .cse13))) (not (= .cse13 0)))))))) is different from true [2024-12-02 13:59:55,294 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse5 .cse4))) (not (= .cse4 0))))))) (= (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 0) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) .cse8 .cse7))) (not (= .cse7 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|)) (.cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse9 (select .cse11 .cse10))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|) .cse10 .cse9) .cse11)) (not (= .cse9 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse13 (select .cse12 .cse14))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse14 .cse13))) (not (= .cse13 0)))))))) is different from true [2024-12-02 13:59:56,326 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_14| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|)))) (not (= 0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_front_~list#1.base|) (+ |c_ULTIMATE.start_aws_linked_list_front_~list#1.offset| 24)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse5 .cse4))) (not (= .cse4 0))))))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (.cse7 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse6 (select .cse8 .cse7))) (or (and (not (= .cse6 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse7 .cse6) .cse8))) (and (= .cse6 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| 0)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|)) (.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse10 (select .cse9 .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|) .cse11 .cse10))) (not (= .cse10 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse13 (select .cse12 .cse14))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_1) .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse14 .cse13))) (not (= .cse13 0)))))))) is different from true [2024-12-02 13:59:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:59:57,647 INFO L93 Difference]: Finished difference Result 309 states and 416 transitions. [2024-12-02 13:59:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-12-02 13:59:57,648 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 28 states have (on average 4.392857142857143) internal successors, (123), 28 states have internal predecessors, (123), 16 states have call successors, (38), 9 states have call predecessors, (38), 12 states have return successors, (37), 14 states have call predecessors, (37), 16 states have call successors, (37) Word has length 118 [2024-12-02 13:59:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:59:57,650 INFO L225 Difference]: With dead ends: 309 [2024-12-02 13:59:57,650 INFO L226 Difference]: Without dead ends: 192 [2024-12-02 13:59:57,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=168, Invalid=895, Unknown=81, NotChecked=1826, Total=2970 [2024-12-02 13:59:57,653 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 47 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 3 mSolverCounterUnsat, 57 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 4732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 57 IncrementalHoareTripleChecker+Unknown, 4095 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-12-02 13:59:57,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1964 Invalid, 4732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 577 Invalid, 57 Unknown, 4095 Unchecked, 1.9s Time] [2024-12-02 13:59:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-12-02 13:59:57,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 182. [2024-12-02 13:59:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 123 states have (on average 1.2520325203252032) internal successors, (154), 125 states have internal predecessors, (154), 40 states have call successors, (40), 17 states have call predecessors, (40), 18 states have return successors, (46), 39 states have call predecessors, (46), 39 states have call successors, (46) [2024-12-02 13:59:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 240 transitions. [2024-12-02 13:59:57,681 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 240 transitions. Word has length 118 [2024-12-02 13:59:57,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:59:57,681 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 240 transitions. [2024-12-02 13:59:57,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 28 states have (on average 4.392857142857143) internal successors, (123), 28 states have internal predecessors, (123), 16 states have call successors, (38), 9 states have call predecessors, (38), 12 states have return successors, (37), 14 states have call predecessors, (37), 16 states have call successors, (37) [2024-12-02 13:59:57,681 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 240 transitions. [2024-12-02 13:59:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-02 13:59:57,682 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:59:57,683 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:59:57,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 13:59:57,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-12-02 13:59:57,883 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:59:57,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:59:57,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1156018838, now seen corresponding path program 1 times [2024-12-02 13:59:57,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:59:57,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774072915] [2024-12-02 13:59:57,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:59:57,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:59:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:59:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-12-02 13:59:57,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:59:57,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774072915] [2024-12-02 13:59:57,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774072915] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:59:57,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17249924] [2024-12-02 13:59:57,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:59:57,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:59:57,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:59:57,972 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:59:57,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 13:59:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:59:58,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 13:59:58,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:59:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-12-02 13:59:58,203 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 13:59:58,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17249924] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:59:58,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 13:59:58,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-12-02 13:59:58,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533096209] [2024-12-02 13:59:58,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:59:58,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:59:58,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:59:58,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:59:58,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:59:58,205 INFO L87 Difference]: Start difference. First operand 182 states and 240 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-12-02 13:59:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:59:58,230 INFO L93 Difference]: Finished difference Result 303 states and 416 transitions. [2024-12-02 13:59:58,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:59:58,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2024-12-02 13:59:58,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:59:58,233 INFO L225 Difference]: With dead ends: 303 [2024-12-02 13:59:58,233 INFO L226 Difference]: Without dead ends: 176 [2024-12-02 13:59:58,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:59:58,235 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:59:58,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:59:58,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-12-02 13:59:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-12-02 13:59:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 118 states have (on average 1.2118644067796611) internal successors, (143), 120 states have internal predecessors, (143), 39 states have call successors, (39), 17 states have call predecessors, (39), 18 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2024-12-02 13:59:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 227 transitions. [2024-12-02 13:59:58,257 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 227 transitions. Word has length 120 [2024-12-02 13:59:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:59:58,257 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 227 transitions. [2024-12-02 13:59:58,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-12-02 13:59:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 227 transitions. [2024-12-02 13:59:58,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-02 13:59:58,258 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:59:58,258 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:59:58,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-12-02 13:59:58,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:59:58,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:59:58,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:59:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash 476746584, now seen corresponding path program 2 times [2024-12-02 13:59:58,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:59:58,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391819462] [2024-12-02 13:59:58,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 13:59:58,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:59:58,508 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 13:59:58,509 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 13:59:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-12-02 13:59:58,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:59:58,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391819462] [2024-12-02 13:59:58,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391819462] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:59:58,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657061740] [2024-12-02 13:59:58,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 13:59:58,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:59:58,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:59:58,731 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:59:58,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 13:59:58,978 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 13:59:58,978 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 13:59:58,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-12-02 13:59:58,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:59:59,030 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-12-02 13:59:59,030 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 16 treesize of output 18 [2024-12-02 13:59:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-12-02 13:59:59,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 13:59:59,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657061740] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:59:59,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 13:59:59,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2024-12-02 13:59:59,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777778052] [2024-12-02 13:59:59,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:59:59,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 13:59:59,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:59:59,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 13:59:59,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-12-02 13:59:59,212 INFO L87 Difference]: Start difference. First operand 176 states and 227 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-12-02 13:59:59,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:59:59,652 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2024-12-02 13:59:59,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 13:59:59,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 120 [2024-12-02 13:59:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:59:59,654 INFO L225 Difference]: With dead ends: 301 [2024-12-02 13:59:59,654 INFO L226 Difference]: Without dead ends: 181 [2024-12-02 13:59:59,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-12-02 13:59:59,656 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 196 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 13:59:59,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 771 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 13:59:59,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-12-02 13:59:59,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2024-12-02 13:59:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 120 states have (on average 1.2083333333333333) internal successors, (145), 123 states have internal predecessors, (145), 39 states have call successors, (39), 17 states have call predecessors, (39), 19 states have return successors, (47), 38 states have call predecessors, (47), 38 states have call successors, (47) [2024-12-02 13:59:59,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 231 transitions. [2024-12-02 13:59:59,688 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 231 transitions. Word has length 120 [2024-12-02 13:59:59,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:59:59,688 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 231 transitions. [2024-12-02 13:59:59,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-12-02 13:59:59,689 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 231 transitions. [2024-12-02 13:59:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-12-02 13:59:59,690 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:59:59,690 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:59:59,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 13:59:59,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-12-02 13:59:59,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:59:59,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:59:59,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1685341926, now seen corresponding path program 1 times [2024-12-02 13:59:59,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:59:59,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35370659] [2024-12-02 13:59:59,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:59:59,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:59:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:00,138 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-12-02 14:00:00,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:00:00,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35370659] [2024-12-02 14:00:00,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35370659] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:00:00,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181319199] [2024-12-02 14:00:00,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:00,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:00,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:00:00,141 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:00:00,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 14:00:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:00,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-02 14:00:00,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:00:00,528 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-12-02 14:00:00,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:00:00,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181319199] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:00:00,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:00:00,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2024-12-02 14:00:00,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976674555] [2024-12-02 14:00:00,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:00:00,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 14:00:00,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:00:00,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 14:00:00,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-12-02 14:00:00,530 INFO L87 Difference]: Start difference. First operand 179 states and 231 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-12-02 14:00:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:00:00,977 INFO L93 Difference]: Finished difference Result 313 states and 419 transitions. [2024-12-02 14:00:00,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 14:00:00,978 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 122 [2024-12-02 14:00:00,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:00:00,980 INFO L225 Difference]: With dead ends: 313 [2024-12-02 14:00:00,980 INFO L226 Difference]: Without dead ends: 190 [2024-12-02 14:00:00,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2024-12-02 14:00:00,981 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 213 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:00:00,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 892 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:00:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-12-02 14:00:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 181. [2024-12-02 14:00:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 125 states have internal predecessors, (148), 39 states have call successors, (39), 17 states have call predecessors, (39), 19 states have return successors, (47), 38 states have call predecessors, (47), 38 states have call successors, (47) [2024-12-02 14:00:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 234 transitions. [2024-12-02 14:00:01,003 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 234 transitions. Word has length 122 [2024-12-02 14:00:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:00:01,004 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 234 transitions. [2024-12-02 14:00:01,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-12-02 14:00:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 234 transitions. [2024-12-02 14:00:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-02 14:00:01,005 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:00:01,006 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:00:01,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 14:00:01,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:01,206 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:00:01,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:00:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1573790499, now seen corresponding path program 1 times [2024-12-02 14:00:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:00:01,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102836465] [2024-12-02 14:00:01,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:01,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:00:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-12-02 14:00:01,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:00:01,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102836465] [2024-12-02 14:00:01,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102836465] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:00:01,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934945742] [2024-12-02 14:00:01,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:01,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:01,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:00:01,489 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:00:01,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 14:00:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:01,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 14:00:01,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:00:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-12-02 14:00:01,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:00:01,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934945742] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:00:01,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:00:01,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-12-02 14:00:01,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496083520] [2024-12-02 14:00:01,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:00:01,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:00:01,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:00:01,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:00:01,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-12-02 14:00:01,748 INFO L87 Difference]: Start difference. First operand 181 states and 234 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-12-02 14:00:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:00:01,793 INFO L93 Difference]: Finished difference Result 310 states and 418 transitions. [2024-12-02 14:00:01,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:00:01,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2024-12-02 14:00:01,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:00:01,796 INFO L225 Difference]: With dead ends: 310 [2024-12-02 14:00:01,796 INFO L226 Difference]: Without dead ends: 185 [2024-12-02 14:00:01,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-12-02 14:00:01,798 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 2 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:00:01,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 344 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:00:01,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-12-02 14:00:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2024-12-02 14:00:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 126 states have internal predecessors, (149), 39 states have call successors, (39), 17 states have call predecessors, (39), 19 states have return successors, (47), 38 states have call predecessors, (47), 38 states have call successors, (47) [2024-12-02 14:00:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 235 transitions. [2024-12-02 14:00:01,828 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 235 transitions. Word has length 123 [2024-12-02 14:00:01,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:00:01,829 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 235 transitions. [2024-12-02 14:00:01,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-12-02 14:00:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 235 transitions. [2024-12-02 14:00:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-02 14:00:01,838 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:00:01,838 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:00:01,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 14:00:02,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:02,038 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:00:02,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:00:02,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2050036187, now seen corresponding path program 1 times [2024-12-02 14:00:02,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:00:02,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464346254] [2024-12-02 14:00:02,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:00:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-12-02 14:00:02,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:00:02,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464346254] [2024-12-02 14:00:02,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464346254] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:00:02,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848064304] [2024-12-02 14:00:02,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:02,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:02,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:00:02,433 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:00:02,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 14:00:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:02,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-12-02 14:00:02,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:00:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-12-02 14:00:02,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:00:02,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848064304] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:00:02,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:00:02,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 14 [2024-12-02 14:00:02,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134565710] [2024-12-02 14:00:02,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:00:02,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 14:00:02,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:00:02,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 14:00:02,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-12-02 14:00:02,883 INFO L87 Difference]: Start difference. First operand 182 states and 235 transitions. Second operand has 12 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 5 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2024-12-02 14:00:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:00:03,279 INFO L93 Difference]: Finished difference Result 314 states and 419 transitions. [2024-12-02 14:00:03,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 14:00:03,279 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 5 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 131 [2024-12-02 14:00:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:00:03,282 INFO L225 Difference]: With dead ends: 314 [2024-12-02 14:00:03,282 INFO L226 Difference]: Without dead ends: 188 [2024-12-02 14:00:03,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-12-02 14:00:03,283 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 171 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:00:03,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1206 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:00:03,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-12-02 14:00:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 183. [2024-12-02 14:00:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 124 states have (on average 1.2096774193548387) internal successors, (150), 127 states have internal predecessors, (150), 39 states have call successors, (39), 17 states have call predecessors, (39), 19 states have return successors, (47), 38 states have call predecessors, (47), 38 states have call successors, (47) [2024-12-02 14:00:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 236 transitions. [2024-12-02 14:00:03,337 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 236 transitions. Word has length 131 [2024-12-02 14:00:03,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:00:03,338 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 236 transitions. [2024-12-02 14:00:03,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 5 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2024-12-02 14:00:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 236 transitions. [2024-12-02 14:00:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-02 14:00:03,339 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:00:03,340 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:00:03,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 14:00:03,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:03,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:00:03,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:00:03,541 INFO L85 PathProgramCache]: Analyzing trace with hash 103621235, now seen corresponding path program 1 times [2024-12-02 14:00:03,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:00:03,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626241295] [2024-12-02 14:00:03,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:03,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:00:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-12-02 14:00:04,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:00:04,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626241295] [2024-12-02 14:00:04,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626241295] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:00:04,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392442463] [2024-12-02 14:00:04,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:04,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:04,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:00:04,042 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:00:04,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 14:00:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:04,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-12-02 14:00:04,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:00:04,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 14:00:04,322 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-12-02 14:00:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 103 proven. 20 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-12-02 14:00:05,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:00:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-12-02 14:00:05,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392442463] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:00:05,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:00:05,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 13] total 33 [2024-12-02 14:00:05,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338032550] [2024-12-02 14:00:05,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:00:05,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-12-02 14:00:05,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:00:05,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-12-02 14:00:05,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2024-12-02 14:00:05,968 INFO L87 Difference]: Start difference. First operand 183 states and 236 transitions. Second operand has 33 states, 33 states have (on average 4.2727272727272725) internal successors, (141), 31 states have internal predecessors, (141), 13 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) [2024-12-02 14:00:09,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:00:09,988 INFO L93 Difference]: Finished difference Result 575 states and 817 transitions. [2024-12-02 14:00:09,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-12-02 14:00:09,989 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.2727272727272725) internal successors, (141), 31 states have internal predecessors, (141), 13 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) Word has length 133 [2024-12-02 14:00:09,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:00:09,991 INFO L225 Difference]: With dead ends: 575 [2024-12-02 14:00:09,992 INFO L226 Difference]: Without dead ends: 442 [2024-12-02 14:00:09,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 244 SyntacticMatches, 10 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=590, Invalid=4812, Unknown=0, NotChecked=0, Total=5402 [2024-12-02 14:00:09,993 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 442 mSDsluCounter, 3083 mSDsCounter, 0 mSdLazyCounter, 2544 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 3275 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 2544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-12-02 14:00:09,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 3275 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 2544 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-12-02 14:00:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-12-02 14:00:10,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 359. [2024-12-02 14:00:10,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 256 states have (on average 1.265625) internal successors, (324), 262 states have internal predecessors, (324), 72 states have call successors, (72), 26 states have call predecessors, (72), 30 states have return successors, (91), 70 states have call predecessors, (91), 70 states have call successors, (91) [2024-12-02 14:00:10,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 487 transitions. [2024-12-02 14:00:10,045 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 487 transitions. Word has length 133 [2024-12-02 14:00:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:00:10,045 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 487 transitions. [2024-12-02 14:00:10,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.2727272727272725) internal successors, (141), 31 states have internal predecessors, (141), 13 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) [2024-12-02 14:00:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 487 transitions. [2024-12-02 14:00:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-02 14:00:10,046 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:00:10,046 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:00:10,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 14:00:10,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:10,247 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:00:10,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:00:10,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1764668175, now seen corresponding path program 1 times [2024-12-02 14:00:10,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:00:10,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248118346] [2024-12-02 14:00:10,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:10,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:00:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-12-02 14:00:10,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:00:10,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248118346] [2024-12-02 14:00:10,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248118346] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:00:10,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389604326] [2024-12-02 14:00:10,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:10,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:10,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:00:10,372 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:00:10,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 14:00:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:10,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 14:00:10,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:00:10,655 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-12-02 14:00:10,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:00:10,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389604326] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:00:10,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:00:10,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-12-02 14:00:10,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452806543] [2024-12-02 14:00:10,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:00:10,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:00:10,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:00:10,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:00:10,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:00:10,657 INFO L87 Difference]: Start difference. First operand 359 states and 487 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 14:00:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:00:10,737 INFO L93 Difference]: Finished difference Result 655 states and 930 transitions. [2024-12-02 14:00:10,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:00:10,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-12-02 14:00:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:00:10,742 INFO L225 Difference]: With dead ends: 655 [2024-12-02 14:00:10,742 INFO L226 Difference]: Without dead ends: 354 [2024-12-02 14:00:10,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 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-12-02 14:00:10,745 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 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-12-02 14:00:10,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:00:10,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-12-02 14:00:10,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2024-12-02 14:00:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 250 states have (on average 1.244) internal successors, (311), 255 states have internal predecessors, (311), 72 states have call successors, (72), 26 states have call predecessors, (72), 29 states have return successors, (89), 70 states have call predecessors, (89), 70 states have call successors, (89) [2024-12-02 14:00:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 472 transitions. [2024-12-02 14:00:10,805 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 472 transitions. Word has length 133 [2024-12-02 14:00:10,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:00:10,806 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 472 transitions. [2024-12-02 14:00:10,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 14:00:10,806 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 472 transitions. [2024-12-02 14:00:10,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-02 14:00:10,808 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:00:10,808 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:00:10,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 14:00:11,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:11,009 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:00:11,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:00:11,009 INFO L85 PathProgramCache]: Analyzing trace with hash 363096365, now seen corresponding path program 1 times [2024-12-02 14:00:11,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:00:11,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415413009] [2024-12-02 14:00:11,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:11,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:00:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-12-02 14:00:11,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:00:11,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415413009] [2024-12-02 14:00:11,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415413009] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:00:11,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364957107] [2024-12-02 14:00:11,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:11,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:11,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:00:11,135 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:00:11,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 14:00:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:11,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 14:00:11,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:00:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-02 14:00:11,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:00:11,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364957107] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:00:11,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:00:11,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-12-02 14:00:11,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160629664] [2024-12-02 14:00:11,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:00:11,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:00:11,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:00:11,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:00:11,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:00:11,434 INFO L87 Difference]: Start difference. First operand 352 states and 472 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 14:00:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:00:11,488 INFO L93 Difference]: Finished difference Result 488 states and 672 transitions. [2024-12-02 14:00:11,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:00:11,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-12-02 14:00:11,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:00:11,490 INFO L225 Difference]: With dead ends: 488 [2024-12-02 14:00:11,490 INFO L226 Difference]: Without dead ends: 189 [2024-12-02 14:00:11,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 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-12-02 14:00:11,493 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:00:11,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:00:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-12-02 14:00:11,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2024-12-02 14:00:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 127 states have (on average 1.1811023622047243) internal successors, (150), 130 states have internal predecessors, (150), 40 states have call successors, (40), 17 states have call predecessors, (40), 19 states have return successors, (48), 39 states have call predecessors, (48), 39 states have call successors, (48) [2024-12-02 14:00:11,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 238 transitions. [2024-12-02 14:00:11,524 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 238 transitions. Word has length 133 [2024-12-02 14:00:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:00:11,524 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 238 transitions. [2024-12-02 14:00:11,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 14:00:11,525 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 238 transitions. [2024-12-02 14:00:11,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-02 14:00:11,525 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:00:11,526 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:00:11,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 14:00:11,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-12-02 14:00:11,726 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:00:11,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:00:11,727 INFO L85 PathProgramCache]: Analyzing trace with hash -214910666, now seen corresponding path program 1 times [2024-12-02 14:00:11,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:00:11,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112452264] [2024-12-02 14:00:11,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:11,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:00:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-12-02 14:00:12,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:00:12,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112452264] [2024-12-02 14:00:12,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112452264] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:00:12,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53698123] [2024-12-02 14:00:12,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:12,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:12,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:00:12,836 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:00:12,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 14:00:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:13,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 130 conjuncts are in the unsatisfiable core [2024-12-02 14:00:13,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:00:13,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-02 14:00:13,423 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-12-02 14:00:13,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:00:13,428 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-12-02 14:00:13,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:00:13,434 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 11 treesize of output 7 [2024-12-02 14:00:13,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:00:13,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-12-02 14:00:13,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:00:13,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2024-12-02 14:00:13,512 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 1 [2024-12-02 14:00:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 137 proven. 19 refuted. 4 times theorem prover too weak. 35 trivial. 0 not checked. [2024-12-02 14:00:23,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:00:27,214 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:00:27,397 INFO L349 Elim1Store]: treesize reduction 256, result has 54.4 percent of original size [2024-12-02 14:00:27,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 1982 treesize of output 1649 [2024-12-02 14:00:27,553 INFO L349 Elim1Store]: treesize reduction 8, result has 91.0 percent of original size [2024-12-02 14:00:27,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1202 treesize of output 1224 [2024-12-02 14:00:27,589 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:00:27,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 992 treesize of output 828 [2024-12-02 14:00:27,699 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 38 treesize of output 4 [2024-12-02 14:00:29,502 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 263 treesize of output 161 [2024-12-02 14:00:30,184 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:00:30,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 752 treesize of output 648 [2024-12-02 14:00:30,273 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-12-02 14:00:30,758 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:00:30,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 8 [2024-12-02 14:00:30,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 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-12-02 14:00:30,928 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:00:30,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 354 treesize of output 246 [2024-12-02 14:00:31,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:00:31,426 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 206 treesize of output 151 [2024-12-02 14:00:31,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:00:31,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 164 [2024-12-02 14:00:31,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:00:31,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 911 treesize of output 895 [2024-12-02 14:00:31,561 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-12-02 14:00:31,561 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 1 case distinctions, treesize of input 830 treesize of output 808 [2024-12-02 14:00:31,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 714 treesize of output 708 [2024-12-02 14:00:32,341 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-12-02 14:00:32,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:00:32,483 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 1 case distinctions, treesize of input 98 treesize of output 96 [2024-12-02 14:00:32,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-12-02 14:00:32,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:00:32,731 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 1 case distinctions, treesize of input 78 treesize of output 78 [2024-12-02 14:00:34,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53698123] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:00:34,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 14:00:34,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 26] total 37 [2024-12-02 14:00:34,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308066567] [2024-12-02 14:00:34,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 14:00:34,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-12-02 14:00:34,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:00:34,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-12-02 14:00:34,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=3241, Unknown=56, NotChecked=0, Total=3540 [2024-12-02 14:00:34,176 INFO L87 Difference]: Start difference. First operand 187 states and 238 transitions. Second operand has 37 states, 34 states have (on average 4.0) internal successors, (136), 32 states have internal predecessors, (136), 15 states have call successors, (33), 8 states have call predecessors, (33), 10 states have return successors, (32), 14 states have call predecessors, (32), 15 states have call successors, (32) [2024-12-02 14:00:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:00:46,205 INFO L93 Difference]: Finished difference Result 360 states and 472 transitions. [2024-12-02 14:00:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-12-02 14:00:46,206 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 4.0) internal successors, (136), 32 states have internal predecessors, (136), 15 states have call successors, (33), 8 states have call predecessors, (33), 10 states have return successors, (32), 14 states have call predecessors, (32), 15 states have call successors, (32) Word has length 134 [2024-12-02 14:00:46,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:00:46,208 INFO L225 Difference]: With dead ends: 360 [2024-12-02 14:00:46,208 INFO L226 Difference]: Without dead ends: 219 [2024-12-02 14:00:46,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 217 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=578, Invalid=6736, Unknown=168, NotChecked=0, Total=7482 [2024-12-02 14:00:46,211 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 396 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 154 mSolverCounterUnsat, 254 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 2589 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 254 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-12-02 14:00:46,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 2589 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1761 Invalid, 254 Unknown, 0 Unchecked, 5.7s Time] [2024-12-02 14:00:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-12-02 14:00:46,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 206. [2024-12-02 14:00:46,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 143 states have (on average 1.1818181818181819) internal successors, (169), 147 states have internal predecessors, (169), 41 states have call successors, (41), 18 states have call predecessors, (41), 21 states have return successors, (50), 40 states have call predecessors, (50), 40 states have call successors, (50) [2024-12-02 14:00:46,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 260 transitions. [2024-12-02 14:00:46,259 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 260 transitions. Word has length 134 [2024-12-02 14:00:46,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:00:46,259 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 260 transitions. [2024-12-02 14:00:46,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 4.0) internal successors, (136), 32 states have internal predecessors, (136), 15 states have call successors, (33), 8 states have call predecessors, (33), 10 states have return successors, (32), 14 states have call predecessors, (32), 15 states have call successors, (32) [2024-12-02 14:00:46,259 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 260 transitions. [2024-12-02 14:00:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-02 14:00:46,260 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:00:46,260 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:00:46,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 14:00:46,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:46,461 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:00:46,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:00:46,461 INFO L85 PathProgramCache]: Analyzing trace with hash -691700538, now seen corresponding path program 2 times [2024-12-02 14:00:46,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:00:46,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698455580] [2024-12-02 14:00:46,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:00:46,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:00:46,515 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 14:00:46,515 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:00:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2024-12-02 14:00:46,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:00:46,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698455580] [2024-12-02 14:00:46,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698455580] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:00:46,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504729317] [2024-12-02 14:00:46,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:00:46,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:46,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:00:46,922 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:00:46,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 14:00:47,226 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 14:00:47,226 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:00:47,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-12-02 14:00:47,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:00:47,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-12-02 14:00:47,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-12-02 14:00:47,340 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 1 [2024-12-02 14:00:47,356 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 1 [2024-12-02 14:00:47,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-12-02 14:00:47,380 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 22 treesize of output 1 [2024-12-02 14:00:48,138 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-12-02 14:00:48,138 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 15 treesize of output 7 [2024-12-02 14:00:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 43 proven. 92 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-12-02 14:00:48,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:00:49,414 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-12-02 14:00:49,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 185 [2024-12-02 14:00:49,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:00:49,432 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 95 treesize of output 97 [2024-12-02 14:00:49,438 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 68 treesize of output 64 [2024-12-02 14:00:49,481 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-12-02 14:00:49,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 98 [2024-12-02 14:00:49,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:00:49,500 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 90 treesize of output 92 [2024-12-02 14:00:49,510 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 33 treesize of output 29 [2024-12-02 14:00:49,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 8 treesize of output 4 [2024-12-02 14:00:49,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-12-02 14:00:49,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-12-02 14:00:49,641 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 20 treesize of output 16 [2024-12-02 14:00:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-12-02 14:00:49,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504729317] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:00:49,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:00:49,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 16] total 38 [2024-12-02 14:00:49,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565237917] [2024-12-02 14:00:49,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:00:49,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-12-02 14:00:49,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:00:49,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-12-02 14:00:49,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1284, Unknown=0, NotChecked=0, Total=1406 [2024-12-02 14:00:49,752 INFO L87 Difference]: Start difference. First operand 206 states and 260 transitions. Second operand has 38 states, 36 states have (on average 4.5) internal successors, (162), 37 states have internal predecessors, (162), 14 states have call successors, (45), 4 states have call predecessors, (45), 9 states have return successors, (45), 13 states have call predecessors, (45), 14 states have call successors, (45) [2024-12-02 14:00:53,790 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-12-02 14:00:57,840 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-12-02 14:01:01,908 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-12-02 14:01:09,609 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-12-02 14:01:13,662 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-12-02 14:01:14,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:01:14,484 INFO L93 Difference]: Finished difference Result 478 states and 633 transitions. [2024-12-02 14:01:14,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-12-02 14:01:14,485 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 4.5) internal successors, (162), 37 states have internal predecessors, (162), 14 states have call successors, (45), 4 states have call predecessors, (45), 9 states have return successors, (45), 13 states have call predecessors, (45), 14 states have call successors, (45) Word has length 144 [2024-12-02 14:01:14,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:01:14,487 INFO L225 Difference]: With dead ends: 478 [2024-12-02 14:01:14,487 INFO L226 Difference]: Without dead ends: 336 [2024-12-02 14:01:14,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 257 SyntacticMatches, 18 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=620, Invalid=5860, Unknown=0, NotChecked=0, Total=6480 [2024-12-02 14:01:14,489 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 334 mSDsluCounter, 2954 mSDsCounter, 0 mSdLazyCounter, 2644 mSolverCounterSat, 255 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 3126 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2644 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2024-12-02 14:01:14,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 3126 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2644 Invalid, 5 Unknown, 0 Unchecked, 22.8s Time] [2024-12-02 14:01:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-12-02 14:01:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 285. [2024-12-02 14:01:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 208 states have (on average 1.2115384615384615) internal successors, (252), 212 states have internal predecessors, (252), 48 states have call successors, (48), 24 states have call predecessors, (48), 28 states have return successors, (57), 48 states have call predecessors, (57), 47 states have call successors, (57) [2024-12-02 14:01:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 357 transitions. [2024-12-02 14:01:14,576 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 357 transitions. Word has length 144 [2024-12-02 14:01:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:01:14,577 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 357 transitions. [2024-12-02 14:01:14,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 4.5) internal successors, (162), 37 states have internal predecessors, (162), 14 states have call successors, (45), 4 states have call predecessors, (45), 9 states have return successors, (45), 13 states have call predecessors, (45), 14 states have call successors, (45) [2024-12-02 14:01:14,577 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 357 transitions. [2024-12-02 14:01:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-02 14:01:14,578 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:01:14,579 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:01:14,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-02 14:01:14,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:01:14,779 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:01:14,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:01:14,780 INFO L85 PathProgramCache]: Analyzing trace with hash -614321338, now seen corresponding path program 1 times [2024-12-02 14:01:14,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:01:14,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457995459] [2024-12-02 14:01:14,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:01:14,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:01:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:01:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-12-02 14:01:16,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:01:16,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457995459] [2024-12-02 14:01:16,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457995459] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:01:16,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814165229] [2024-12-02 14:01:16,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:01:16,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:01:16,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:01:16,307 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:01:16,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-02 14:01:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:01:16,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-12-02 14:01:16,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:01:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-12-02 14:01:16,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:01:16,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814165229] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:01:16,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:01:16,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2024-12-02 14:01:16,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219493528] [2024-12-02 14:01:16,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:01:16,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 14:01:16,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:01:16,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 14:01:16,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2024-12-02 14:01:16,854 INFO L87 Difference]: Start difference. First operand 285 states and 357 transitions. Second operand has 11 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 6 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-12-02 14:01:17,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:01:17,297 INFO L93 Difference]: Finished difference Result 494 states and 632 transitions. [2024-12-02 14:01:17,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 14:01:17,297 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 6 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 144 [2024-12-02 14:01:17,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:01:17,299 INFO L225 Difference]: With dead ends: 494 [2024-12-02 14:01:17,299 INFO L226 Difference]: Without dead ends: 295 [2024-12-02 14:01:17,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2024-12-02 14:01:17,300 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 175 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:01:17,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1062 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:01:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-12-02 14:01:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 280. [2024-12-02 14:01:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 204 states have (on average 1.2107843137254901) internal successors, (247), 208 states have internal predecessors, (247), 48 states have call successors, (48), 24 states have call predecessors, (48), 27 states have return successors, (56), 47 states have call predecessors, (56), 47 states have call successors, (56) [2024-12-02 14:01:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 351 transitions. [2024-12-02 14:01:17,362 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 351 transitions. Word has length 144 [2024-12-02 14:01:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:01:17,363 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 351 transitions. [2024-12-02 14:01:17,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 6 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-12-02 14:01:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 351 transitions. [2024-12-02 14:01:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-02 14:01:17,364 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:01:17,364 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:01:17,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-12-02 14:01:17,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-12-02 14:01:17,565 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:01:17,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:01:17,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1709264773, now seen corresponding path program 1 times [2024-12-02 14:01:17,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:01:17,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607593010] [2024-12-02 14:01:17,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:01:17,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:01:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:01:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-12-02 14:01:17,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:01:17,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607593010] [2024-12-02 14:01:17,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607593010] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:01:17,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973641299] [2024-12-02 14:01:17,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:01:17,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:01:17,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:01:17,805 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:01:17,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-02 14:01:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:01:18,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-12-02 14:01:18,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:01:18,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-02 14:01:18,209 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-12-02 14:01:18,218 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-12-02 14:01:18,276 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 14:01:18,276 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 11 treesize of output 11 [2024-12-02 14:01:18,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:01:18,286 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-12-02 14:01:18,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:01:18,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:01:18,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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-12-02 14:01:18,300 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-12-02 14:01:18,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-12-02 14:01:18,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:01:18,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:01:18,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:01:18,445 INFO L349 Elim1Store]: treesize reduction 197, result has 11.7 percent of original size [2024-12-02 14:01:18,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 191 treesize of output 96 [2024-12-02 14:01:18,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:01:18,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:01:18,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2024-12-02 14:01:21,250 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 114 proven. 21 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-12-02 14:01:21,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:01:21,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:01:21,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 96 [2024-12-02 14:01:21,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:01:21,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-12-02 14:01:21,995 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:01:21,996 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:01:22,088 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-12-02 14:01:22,089 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 173 treesize of output 202 [2024-12-02 14:01:22,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:01:22,107 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 230 [2024-12-02 14:01:22,118 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:01:22,119 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:01:22,181 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-12-02 14:01:22,182 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 371 treesize of output 358 [2024-12-02 14:01:22,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:01:22,203 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 340 treesize of output 320 [2024-12-02 14:01:22,219 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 279 treesize of output 267 [2024-12-02 14:01:22,232 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 291 treesize of output 279 [2024-12-02 14:01:23,367 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-12-02 14:01:23,615 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-12-02 14:01:23,641 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:01:23,642 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:01:23,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:01:23,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 238 treesize of output 244 [2024-12-02 14:01:24,159 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:01:24,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:01:24,175 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 364 treesize of output 342 [2024-12-02 14:01:26,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973641299] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:01:26,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 14:01:26,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 17 [2024-12-02 14:01:26,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830921829] [2024-12-02 14:01:26,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 14:01:26,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 14:01:26,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:01:26,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 14:01:26,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=573, Unknown=1, NotChecked=0, Total=650 [2024-12-02 14:01:26,372 INFO L87 Difference]: Start difference. First operand 280 states and 351 transitions. Second operand has 17 states, 15 states have (on average 8.333333333333334) internal successors, (125), 16 states have internal predecessors, (125), 8 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) [2024-12-02 14:01:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:01:29,244 INFO L93 Difference]: Finished difference Result 656 states and 825 transitions. [2024-12-02 14:01:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-12-02 14:01:29,245 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.333333333333334) internal successors, (125), 16 states have internal predecessors, (125), 8 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) Word has length 145 [2024-12-02 14:01:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:01:29,247 INFO L225 Difference]: With dead ends: 656 [2024-12-02 14:01:29,247 INFO L226 Difference]: Without dead ends: 440 [2024-12-02 14:01:29,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 249 SyntacticMatches, 15 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=206, Invalid=1515, Unknown=1, NotChecked=0, Total=1722 [2024-12-02 14:01:29,248 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 274 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-12-02 14:01:29,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1424 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-12-02 14:01:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-12-02 14:01:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 430. [2024-12-02 14:01:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 314 states have (on average 1.194267515923567) internal successors, (375), 319 states have internal predecessors, (375), 72 states have call successors, (72), 41 states have call predecessors, (72), 43 states have return successors, (83), 69 states have call predecessors, (83), 71 states have call successors, (83) [2024-12-02 14:01:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 530 transitions. [2024-12-02 14:01:29,322 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 530 transitions. Word has length 145 [2024-12-02 14:01:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:01:29,322 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 530 transitions. [2024-12-02 14:01:29,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.333333333333334) internal successors, (125), 16 states have internal predecessors, (125), 8 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) [2024-12-02 14:01:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 530 transitions. [2024-12-02 14:01:29,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-02 14:01:29,324 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:01:29,324 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:01:29,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-12-02 14:01:29,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-12-02 14:01:29,525 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:01:29,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:01:29,525 INFO L85 PathProgramCache]: Analyzing trace with hash -2079529123, now seen corresponding path program 1 times [2024-12-02 14:01:29,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:01:29,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555951576] [2024-12-02 14:01:29,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:01:29,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:01:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:01:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-12-02 14:01:29,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:01:29,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555951576] [2024-12-02 14:01:29,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555951576] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:01:29,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031580876] [2024-12-02 14:01:29,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:01:29,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:01:29,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:01:29,718 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:01:29,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-12-02 14:01:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:01:29,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-12-02 14:01:29,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:01:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-12-02 14:01:30,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:01:30,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031580876] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:01:30,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:01:30,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2024-12-02 14:01:30,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135441654] [2024-12-02 14:01:30,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:01:30,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 14:01:30,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:01:30,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 14:01:30,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-12-02 14:01:30,102 INFO L87 Difference]: Start difference. First operand 430 states and 530 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 9 states have internal predecessors, (76), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2024-12-02 14:01:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:01:30,495 INFO L93 Difference]: Finished difference Result 696 states and 878 transitions. [2024-12-02 14:01:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 14:01:30,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 9 states have internal predecessors, (76), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 147 [2024-12-02 14:01:30,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:01:30,498 INFO L225 Difference]: With dead ends: 696 [2024-12-02 14:01:30,498 INFO L226 Difference]: Without dead ends: 438 [2024-12-02 14:01:30,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2024-12-02 14:01:30,499 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 199 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:01:30,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 919 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:01:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-12-02 14:01:30,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 430. [2024-12-02 14:01:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 314 states have (on average 1.1878980891719746) internal successors, (373), 319 states have internal predecessors, (373), 72 states have call successors, (72), 41 states have call predecessors, (72), 43 states have return successors, (83), 69 states have call predecessors, (83), 71 states have call successors, (83) [2024-12-02 14:01:30,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 528 transitions. [2024-12-02 14:01:30,592 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 528 transitions. Word has length 147 [2024-12-02 14:01:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:01:30,593 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 528 transitions. [2024-12-02 14:01:30,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 9 states have internal predecessors, (76), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2024-12-02 14:01:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 528 transitions. [2024-12-02 14:01:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-02 14:01:30,594 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:01:30,594 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:01:30,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-12-02 14:01:30,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-12-02 14:01:30,794 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:01:30,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:01:30,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1690705364, now seen corresponding path program 1 times [2024-12-02 14:01:30,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:01:30,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964121164] [2024-12-02 14:01:30,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:01:30,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:01:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:01:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-12-02 14:01:31,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:01:31,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964121164] [2024-12-02 14:01:31,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964121164] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:01:31,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899601056] [2024-12-02 14:01:31,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:01:31,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:01:31,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:01:31,433 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:01:31,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-12-02 14:01:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:01:31,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-12-02 14:01:31,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:01:31,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-12-02 14:01:31,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-12-02 14:01:36,196 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_6| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_6|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_6|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6|) 8))) (and (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1)) (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_6| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1))))) is different from true [2024-12-02 14:01:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 146 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 13 not checked. [2024-12-02 14:01:37,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:01:43,370 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|) 8))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) |c_aws_linked_list_node_next_is_valid_#in~node.base|) (= |c_aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1)))) (and (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_10| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_10|)) (+ 8 (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_10|))) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_10|)) (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_10| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10| Int)) (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_10|)) (+ 8 (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_10|)))))) (= (mod |c_aws_linked_list_node_next_is_valid_#res| 256) 0)) is different from false [2024-12-02 14:01:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 168 trivial. 2 not checked. [2024-12-02 14:01:44,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899601056] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:01:44,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:01:44,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 26, 20] total 48 [2024-12-02 14:01:44,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405901864] [2024-12-02 14:01:44,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:01:44,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-12-02 14:01:44,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:01:44,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-12-02 14:01:44,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1923, Unknown=2, NotChecked=178, Total=2256 [2024-12-02 14:01:44,016 INFO L87 Difference]: Start difference. First operand 430 states and 528 transitions. Second operand has 48 states, 45 states have (on average 4.044444444444444) internal successors, (182), 41 states have internal predecessors, (182), 15 states have call successors, (39), 4 states have call predecessors, (39), 13 states have return successors, (39), 13 states have call predecessors, (39), 15 states have call successors, (39) [2024-12-02 14:01:56,031 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 [1] [2024-12-02 14:02:00,296 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 [1] [2024-12-02 14:03:52,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:52,547 INFO L93 Difference]: Finished difference Result 821 states and 1038 transitions. [2024-12-02 14:03:52,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-12-02 14:03:52,548 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 4.044444444444444) internal successors, (182), 41 states have internal predecessors, (182), 15 states have call successors, (39), 4 states have call predecessors, (39), 13 states have return successors, (39), 13 states have call predecessors, (39), 15 states have call successors, (39) Word has length 158 [2024-12-02 14:03:52,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:52,552 INFO L225 Difference]: With dead ends: 821 [2024-12-02 14:03:52,552 INFO L226 Difference]: Without dead ends: 567 [2024-12-02 14:03:52,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 284 SyntacticMatches, 6 SemanticMatches, 106 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2631 ImplicationChecksByTransitivity, 125.4s TimeCoverageRelationStatistics Valid=910, Invalid=10200, Unknown=28, NotChecked=418, Total=11556 [2024-12-02 14:03:52,557 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 355 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 3791 mSolverCounterSat, 276 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 3945 SdHoareTripleChecker+Invalid, 4688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 3791 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 619 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:52,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 3945 Invalid, 4688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 3791 Invalid, 2 Unknown, 619 Unchecked, 13.3s Time] [2024-12-02 14:03:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-12-02 14:03:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 497. [2024-12-02 14:03:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 368 states have (on average 1.203804347826087) internal successors, (443), 372 states have internal predecessors, (443), 79 states have call successors, (79), 45 states have call predecessors, (79), 49 states have return successors, (94), 79 states have call predecessors, (94), 77 states have call successors, (94) [2024-12-02 14:03:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 616 transitions. [2024-12-02 14:03:52,666 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 616 transitions. Word has length 158 [2024-12-02 14:03:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:52,666 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 616 transitions. [2024-12-02 14:03:52,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 4.044444444444444) internal successors, (182), 41 states have internal predecessors, (182), 15 states have call successors, (39), 4 states have call predecessors, (39), 13 states have return successors, (39), 13 states have call predecessors, (39), 15 states have call successors, (39) [2024-12-02 14:03:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 616 transitions. [2024-12-02 14:03:52,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-12-02 14:03:52,668 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:52,668 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 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, 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] [2024-12-02 14:03:52,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-12-02 14:03:52,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-12-02 14:03:52,869 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:03:52,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:52,870 INFO L85 PathProgramCache]: Analyzing trace with hash -994633093, now seen corresponding path program 1 times [2024-12-02 14:03:52,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:52,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810717968] [2024-12-02 14:03:52,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:52,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:54,019 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-12-02 14:03:54,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:54,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810717968] [2024-12-02 14:03:54,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810717968] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:03:54,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623013390] [2024-12-02 14:03:54,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:54,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:54,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:03:54,021 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:03:54,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-12-02 14:03:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:54,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-12-02 14:03:54,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:03:54,417 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-12-02 14:03:54,419 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-12-02 14:03:58,617 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_12| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12| Int)) (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_12|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_12| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12| Int)) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_12|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12|) (+ 16 |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12|))))) is different from true [2024-12-02 14:04:02,736 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_75| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_75| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_75|) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_75| Int)) (not (= 16 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_75|) 0))))) is different from true [2024-12-02 14:04:06,874 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_46| Int)) (not (= 16 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_46|) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_46| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_46| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_46|) 0))))) is different from true [2024-12-02 14:04:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 154 proven. 24 refuted. 0 times theorem prover too weak. 58 trivial. 7 not checked. [2024-12-02 14:04:31,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:04:31,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623013390] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:04:31,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 14:04:31,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 29 [2024-12-02 14:04:31,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750974007] [2024-12-02 14:04:31,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 14:04:31,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-12-02 14:04:31,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:04:31,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-12-02 14:04:31,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=626, Unknown=9, NotChecked=156, Total=870 [2024-12-02 14:04:31,656 INFO L87 Difference]: Start difference. First operand 497 states and 616 transitions. Second operand has 29 states, 27 states have (on average 5.2592592592592595) internal successors, (142), 28 states have internal predecessors, (142), 15 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (33), 13 states have call predecessors, (33), 15 states have call successors, (33) [2024-12-02 14:04:35,994 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-12-02 14:04:44,034 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-12-02 14:04:48,040 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-12-02 14:04:52,043 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-12-02 14:04:56,053 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-12-02 14:05:00,060 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-12-02 14:05:04,071 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-12-02 14:05:08,077 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-12-02 14:05:12,087 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-12-02 14:05:16,095 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-12-02 14:05:24,132 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-12-02 14:05:28,136 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-12-02 14:05:40,172 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-12-02 14:05:44,175 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-12-02 14:05:48,185 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-12-02 14:05:52,188 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-12-02 14:05:56,222 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-12-02 14:06:00,226 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-12-02 14:06:04,249 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-12-02 14:06:08,254 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-12-02 14:06:20,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-12-02 14:06:24,299 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-12-02 14:06:28,308 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-12-02 14:06:32,313 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-12-02 14:06:36,343 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-12-02 14:06:40,351 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-12-02 14:06:44,362 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-12-02 14:06:48,370 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-12-02 14:06:52,387 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-12-02 14:07:36,676 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_46| Int)) (not (= 16 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_46|) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_46| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_46| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_46|) 0))))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_12| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12| Int)) (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_12|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_12| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12| Int)) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_12|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12|) (+ 16 |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12|)))))) is different from true [2024-12-02 14:07:44,765 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-12-02 14:07:48,767 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-12-02 14:07:52,885 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-12-02 14:07:56,888 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-12-02 14:08:00,893 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-12-02 14:08:04,896 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-12-02 14:08:08,899 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-12-02 14:08:12,926 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-12-02 14:08:16,930 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-12-02 14:08:20,933 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-12-02 14:08:24,935 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-12-02 14:08:28,939 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-12-02 14:08:33,065 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-12-02 14:08:37,066 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-12-02 14:08:41,212 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-12-02 14:08:45,217 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-12-02 14:08:49,221 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-12-02 14:08:53,224 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-12-02 14:08:57,227 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-12-02 14:09:01,231 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-12-02 14:09:05,234 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-12-02 14:09:09,237 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-12-02 14:09:13,240 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-12-02 14:09:17,243 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-12-02 14:09:21,246 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-12-02 14:09:25,249 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-12-02 14:09:29,253 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-12-02 14:09:33,256 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-12-02 14:09:37,259 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-12-02 14:09:41,263 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-12-02 14:09:45,265 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-12-02 14:09:49,284 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-12-02 14:09:53,286 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-12-02 14:09:57,290 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-12-02 14:10:01,292 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-12-02 14:10:05,298 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-12-02 14:10:09,300 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-12-02 14:10:13,304 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-12-02 14:10:17,306 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-12-02 14:10:21,308 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-12-02 14:10:25,310 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-12-02 14:10:29,314 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-12-02 14:10:33,318 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-12-02 14:10:37,326 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-12-02 14:10:41,333 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-12-02 14:10:45,335 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-12-02 14:10:45,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:10:45,481 INFO L93 Difference]: Finished difference Result 1028 states and 1363 transitions. [2024-12-02 14:10:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-12-02 14:10:45,482 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 5.2592592592592595) internal successors, (142), 28 states have internal predecessors, (142), 15 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (33), 13 states have call predecessors, (33), 15 states have call successors, (33) Word has length 161 [2024-12-02 14:10:45,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:10:45,484 INFO L225 Difference]: With dead ends: 1028 [2024-12-02 14:10:45,485 INFO L226 Difference]: Without dead ends: 701 [2024-12-02 14:10:45,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 109.2s TimeCoverageRelationStatistics Valid=185, Invalid=1526, Unknown=27, NotChecked=332, Total=2070 [2024-12-02 14:10:45,486 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 114 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 73 mSolverCounterUnsat, 75 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 301.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 75 IncrementalHoareTripleChecker+Unknown, 1532 IncrementalHoareTripleChecker+Unchecked, 301.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:10:45,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 2354 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1266 Invalid, 75 Unknown, 1532 Unchecked, 301.2s Time] [2024-12-02 14:10:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-12-02 14:10:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 578. [2024-12-02 14:10:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 438 states have (on average 1.2077625570776256) internal successors, (529), 438 states have internal predecessors, (529), 83 states have call successors, (83), 52 states have call predecessors, (83), 56 states have return successors, (111), 87 states have call predecessors, (111), 81 states have call successors, (111) [2024-12-02 14:10:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 723 transitions. [2024-12-02 14:10:45,634 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 723 transitions. Word has length 161 [2024-12-02 14:10:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:10:45,634 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 723 transitions. [2024-12-02 14:10:45,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 5.2592592592592595) internal successors, (142), 28 states have internal predecessors, (142), 15 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (33), 13 states have call predecessors, (33), 15 states have call successors, (33) [2024-12-02 14:10:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 723 transitions. [2024-12-02 14:10:45,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-12-02 14:10:45,636 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:10:45,636 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1] [2024-12-02 14:10:45,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-12-02 14:10:45,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:10:45,836 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:10:45,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:10:45,837 INFO L85 PathProgramCache]: Analyzing trace with hash 980293385, now seen corresponding path program 1 times [2024-12-02 14:10:45,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:10:45,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002668611] [2024-12-02 14:10:45,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:10:45,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:10:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:10:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2024-12-02 14:10:46,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:10:46,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002668611] [2024-12-02 14:10:46,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002668611] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:10:46,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868865593] [2024-12-02 14:10:46,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:10:46,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:10:46,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:10:46,545 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:10:46,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-12-02 14:10:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:10:46,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-12-02 14:10:46,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:10:46,906 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-12-02 14:10:46,908 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-12-02 14:10:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 162 proven. 44 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-02 14:10:48,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:10:50,489 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 282 treesize of output 274 [2024-12-02 14:10:50,494 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:10:50,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:10:50,497 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 78 treesize of output 70 [2024-12-02 14:10:50,501 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 70 treesize of output 58 [2024-12-02 14:10:50,504 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 58 treesize of output 54 [2024-12-02 14:10:50,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:10:50,513 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 61 [2024-12-02 14:10:50,529 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:10:50,531 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 78 treesize of output 70 [2024-12-02 14:10:50,535 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 26 treesize of output 22 [2024-12-02 14:10:50,538 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 28 treesize of output 22 [2024-12-02 14:10:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-12-02 14:10:50,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868865593] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:10:50,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:10:50,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 19] total 50 [2024-12-02 14:10:50,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787844546] [2024-12-02 14:10:50,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:10:50,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-12-02 14:10:50,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:10:50,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-12-02 14:10:50,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2279, Unknown=0, NotChecked=0, Total=2450 [2024-12-02 14:10:50,608 INFO L87 Difference]: Start difference. First operand 578 states and 723 transitions. Second operand has 50 states, 47 states have (on average 4.212765957446808) internal successors, (198), 47 states have internal predecessors, (198), 28 states have call successors, (50), 3 states have call predecessors, (50), 9 states have return successors, (49), 25 states have call predecessors, (49), 28 states have call successors, (49) [2024-12-02 14:10:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:10:57,174 INFO L93 Difference]: Finished difference Result 1477 states and 1969 transitions. [2024-12-02 14:10:57,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-12-02 14:10:57,175 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 4.212765957446808) internal successors, (198), 47 states have internal predecessors, (198), 28 states have call successors, (50), 3 states have call predecessors, (50), 9 states have return successors, (49), 25 states have call predecessors, (49), 28 states have call successors, (49) Word has length 171 [2024-12-02 14:10:57,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:10:57,178 INFO L225 Difference]: With dead ends: 1477 [2024-12-02 14:10:57,178 INFO L226 Difference]: Without dead ends: 1123 [2024-12-02 14:10:57,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 315 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=545, Invalid=5307, Unknown=0, NotChecked=0, Total=5852 [2024-12-02 14:10:57,180 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 447 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 3502 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 4212 SdHoareTripleChecker+Invalid, 3846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 3502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:10:57,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 4212 Invalid, 3846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 3502 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-12-02 14:10:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2024-12-02 14:10:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 858. [2024-12-02 14:10:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 646 states have (on average 1.2074303405572755) internal successors, (780), 648 states have internal predecessors, (780), 131 states have call successors, (131), 74 states have call predecessors, (131), 80 states have return successors, (191), 135 states have call predecessors, (191), 129 states have call successors, (191) [2024-12-02 14:10:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1102 transitions. [2024-12-02 14:10:57,424 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1102 transitions. Word has length 171 [2024-12-02 14:10:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:10:57,425 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1102 transitions. [2024-12-02 14:10:57,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 4.212765957446808) internal successors, (198), 47 states have internal predecessors, (198), 28 states have call successors, (50), 3 states have call predecessors, (50), 9 states have return successors, (49), 25 states have call predecessors, (49), 28 states have call successors, (49) [2024-12-02 14:10:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1102 transitions. [2024-12-02 14:10:57,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-02 14:10:57,427 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:10:57,427 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:10:57,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-12-02 14:10:57,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:10:57,628 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:10:57,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:10:57,628 INFO L85 PathProgramCache]: Analyzing trace with hash -854491382, now seen corresponding path program 2 times [2024-12-02 14:10:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:10:57,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632765027] [2024-12-02 14:10:57,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:10:57,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:10:57,735 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 14:10:57,735 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:10:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 10 proven. 46 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-12-02 14:10:58,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:10:58,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632765027] [2024-12-02 14:10:58,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632765027] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:10:58,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96874623] [2024-12-02 14:10:58,590 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:10:58,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:10:58,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:10:58,591 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:10:58,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-12-02 14:10:58,974 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 14:10:58,974 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:10:58,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-12-02 14:10:58,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:10:58,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-02 14:10:59,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-12-02 14:10:59,163 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-12-02 14:10:59,242 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 14:10:59,243 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 11 treesize of output 11 [2024-12-02 14:10:59,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:10:59,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-12-02 14:10:59,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:10:59,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:10:59,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-12-02 14:10:59,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-12-02 14:10:59,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-12-02 14:10:59,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:10:59,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:10:59,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:10:59,397 INFO L349 Elim1Store]: treesize reduction 179, result has 10.9 percent of original size [2024-12-02 14:10:59,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 181 treesize of output 90 [2024-12-02 14:10:59,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:10:59,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:10:59,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 47 [2024-12-02 14:11:03,023 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 33 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-12-02 14:11:03,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:11:03,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:11:03,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 96 [2024-12-02 14:11:03,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:11:03,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-12-02 14:11:03,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:11:03,686 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:11:03,744 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2024-12-02 14:11:03,745 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 173 treesize of output 202 [2024-12-02 14:11:03,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:11:03,755 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 230 [2024-12-02 14:11:03,762 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 197 treesize of output 185 [2024-12-02 14:11:03,785 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:11:03,786 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:11:03,840 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2024-12-02 14:11:03,841 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 257 treesize of output 286 [2024-12-02 14:11:03,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:11:03,859 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 344 treesize of output 328 [2024-12-02 14:11:03,868 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 287 treesize of output 275 [2024-12-02 14:11:04,298 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-12-02 14:11:04,397 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-12-02 14:11:04,721 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:11:04,721 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:11:04,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:11:04,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 389 treesize of output 395 [2024-12-02 14:11:05,676 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:11:05,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:11:05,689 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 640 treesize of output 576 [2024-12-02 14:11:08,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96874623] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:11:08,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 14:11:08,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2024-12-02 14:11:08,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32031385] [2024-12-02 14:11:08,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 14:11:08,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-12-02 14:11:08,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:11:08,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-12-02 14:11:08,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=718, Unknown=1, NotChecked=0, Total=812 [2024-12-02 14:11:08,170 INFO L87 Difference]: Start difference. First operand 858 states and 1102 transitions. Second operand has 24 states, 24 states have (on average 5.375) internal successors, (129), 23 states have internal predecessors, (129), 10 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (31), 10 states have call predecessors, (31), 9 states have call successors, (31) [2024-12-02 14:11:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:11:11,176 INFO L93 Difference]: Finished difference Result 1235 states and 1577 transitions. [2024-12-02 14:11:11,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-12-02 14:11:11,176 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.375) internal successors, (129), 23 states have internal predecessors, (129), 10 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (31), 10 states have call predecessors, (31), 9 states have call successors, (31) Word has length 172 [2024-12-02 14:11:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:11:11,180 INFO L225 Difference]: With dead ends: 1235 [2024-12-02 14:11:11,180 INFO L226 Difference]: Without dead ends: 893 [2024-12-02 14:11:11,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 307 SyntacticMatches, 23 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=328, Invalid=2221, Unknown=1, NotChecked=0, Total=2550 [2024-12-02 14:11:11,181 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 362 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-12-02 14:11:11,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1713 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-12-02 14:11:11,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2024-12-02 14:11:11,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 858. [2024-12-02 14:11:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 646 states have (on average 1.2012383900928794) internal successors, (776), 648 states have internal predecessors, (776), 131 states have call successors, (131), 74 states have call predecessors, (131), 80 states have return successors, (191), 135 states have call predecessors, (191), 129 states have call successors, (191) [2024-12-02 14:11:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1098 transitions. [2024-12-02 14:11:11,511 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1098 transitions. Word has length 172 [2024-12-02 14:11:11,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:11:11,511 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1098 transitions. [2024-12-02 14:11:11,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.375) internal successors, (129), 23 states have internal predecessors, (129), 10 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (31), 10 states have call predecessors, (31), 9 states have call successors, (31) [2024-12-02 14:11:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1098 transitions. [2024-12-02 14:11:11,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-02 14:11:11,513 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:11:11,513 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:11:11,525 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-12-02 14:11:11,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:11:11,714 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:11:11,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:11:11,714 INFO L85 PathProgramCache]: Analyzing trace with hash -596325944, now seen corresponding path program 1 times [2024-12-02 14:11:11,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:11:11,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008469642] [2024-12-02 14:11:11,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:11:11,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:11:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:11:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 10 proven. 48 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-12-02 14:11:12,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:11:12,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008469642] [2024-12-02 14:11:12,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008469642] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:11:12,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171097895] [2024-12-02 14:11:12,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:11:12,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:11:12,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:11:12,418 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:11:12,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-12-02 14:11:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:11:12,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-12-02 14:11:12,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:11:12,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-12-02 14:11:12,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-12-02 14:11:17,072 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_23| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_23| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_23|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_23|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_23| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_23| Int)) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_23|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_23|) 0)))) is different from true [2024-12-02 14:11:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 161 proven. 14 refuted. 0 times theorem prover too weak. 99 trivial. 6 not checked. [2024-12-02 14:11:18,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:11:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 66 proven. 16 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-12-02 14:11:18,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171097895] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:11:18,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:11:18,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 15] total 36 [2024-12-02 14:11:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517592317] [2024-12-02 14:11:18,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:11:18,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-12-02 14:11:18,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:11:18,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-12-02 14:11:18,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1083, Unknown=1, NotChecked=66, Total=1260 [2024-12-02 14:11:18,884 INFO L87 Difference]: Start difference. First operand 858 states and 1098 transitions. Second operand has 36 states, 35 states have (on average 4.142857142857143) internal successors, (145), 35 states have internal predecessors, (145), 13 states have call successors, (36), 4 states have call predecessors, (36), 7 states have return successors, (36), 10 states have call predecessors, (36), 12 states have call successors, (36) [2024-12-02 14:11:22,922 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-12-02 14:11:26,962 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-12-02 14:11:31,026 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-12-02 14:11:50,003 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-12-02 14:11:54,047 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-12-02 14:11:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:11:54,858 INFO L93 Difference]: Finished difference Result 1853 states and 2405 transitions. [2024-12-02 14:11:54,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-12-02 14:11:54,858 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.142857142857143) internal successors, (145), 35 states have internal predecessors, (145), 13 states have call successors, (36), 4 states have call predecessors, (36), 7 states have return successors, (36), 10 states have call predecessors, (36), 12 states have call successors, (36) Word has length 172 [2024-12-02 14:11:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:11:54,863 INFO L225 Difference]: With dead ends: 1853 [2024-12-02 14:11:54,863 INFO L226 Difference]: Without dead ends: 1113 [2024-12-02 14:11:54,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 328 SyntacticMatches, 14 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1576 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=581, Invalid=5425, Unknown=4, NotChecked=152, Total=6162 [2024-12-02 14:11:54,866 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 268 mSDsluCounter, 3060 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 119 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 3229 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:11:54,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 3229 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2407 Invalid, 5 Unknown, 346 Unchecked, 22.1s Time] [2024-12-02 14:11:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-12-02 14:11:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 921. [2024-12-02 14:11:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 703 states have (on average 1.1920341394025604) internal successors, (838), 708 states have internal predecessors, (838), 131 states have call successors, (131), 78 states have call predecessors, (131), 86 states have return successors, (191), 134 states have call predecessors, (191), 129 states have call successors, (191) [2024-12-02 14:11:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1160 transitions. [2024-12-02 14:11:55,061 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1160 transitions. Word has length 172 [2024-12-02 14:11:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:11:55,062 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1160 transitions. [2024-12-02 14:11:55,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.142857142857143) internal successors, (145), 35 states have internal predecessors, (145), 13 states have call successors, (36), 4 states have call predecessors, (36), 7 states have return successors, (36), 10 states have call predecessors, (36), 12 states have call successors, (36) [2024-12-02 14:11:55,062 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1160 transitions. [2024-12-02 14:11:55,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-02 14:11:55,063 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:11:55,063 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:11:55,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-12-02 14:11:55,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-12-02 14:11:55,264 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:11:55,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:11:55,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1607443194, now seen corresponding path program 1 times [2024-12-02 14:11:55,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:11:55,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656711391] [2024-12-02 14:11:55,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:11:55,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:11:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:11:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-12-02 14:11:55,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:11:55,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656711391] [2024-12-02 14:11:55,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656711391] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:11:55,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:11:55,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 14:11:55,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506399171] [2024-12-02 14:11:55,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:11:55,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 14:11:55,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:11:55,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 14:11:55,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:11:55,442 INFO L87 Difference]: Start difference. First operand 921 states and 1160 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2024-12-02 14:11:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:11:55,904 INFO L93 Difference]: Finished difference Result 1967 states and 2558 transitions. [2024-12-02 14:11:55,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 14:11:55,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 172 [2024-12-02 14:11:55,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:11:55,910 INFO L225 Difference]: With dead ends: 1967 [2024-12-02 14:11:55,910 INFO L226 Difference]: Without dead ends: 893 [2024-12-02 14:11:55,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-12-02 14:11:55,913 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 60 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:11:55,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 826 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:11:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2024-12-02 14:11:56,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 893. [2024-12-02 14:11:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 675 states have (on average 1.1762962962962964) internal successors, (794), 680 states have internal predecessors, (794), 131 states have call successors, (131), 78 states have call predecessors, (131), 86 states have return successors, (191), 134 states have call predecessors, (191), 129 states have call successors, (191) [2024-12-02 14:11:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1116 transitions. [2024-12-02 14:11:56,153 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1116 transitions. Word has length 172 [2024-12-02 14:11:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:11:56,153 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1116 transitions. [2024-12-02 14:11:56,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2024-12-02 14:11:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1116 transitions. [2024-12-02 14:11:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-12-02 14:11:56,155 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:11:56,155 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:11:56,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 14:11:56,155 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:11:56,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:11:56,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1753081418, now seen corresponding path program 2 times [2024-12-02 14:11:56,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:11:56,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256816419] [2024-12-02 14:11:56,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:11:56,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:11:56,208 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 14:11:56,208 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:11:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 4 proven. 61 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-12-02 14:11:57,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:11:57,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256816419] [2024-12-02 14:11:57,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256816419] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:11:57,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416374360] [2024-12-02 14:11:57,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:11:57,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:11:57,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:11:57,778 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:11:57,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cda489a-0cc8-4c9c-92f6-368343601e29/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-12-02 14:11:58,145 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 14:11:58,145 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:11:58,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-12-02 14:11:58,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:11:58,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-02 14:11:58,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-12-02 14:11:58,294 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-12-02 14:11:58,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:11:58,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-12-02 14:11:58,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:11:58,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:11:58,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-12-02 14:11:58,392 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-12-02 14:11:58,392 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 1 case distinctions, treesize of input 30 treesize of output 25 [2024-12-02 14:11:58,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:11:58,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:11:58,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2024-12-02 14:11:58,427 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-12-02 14:11:58,427 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-12-02 14:11:58,442 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 14:11:58,442 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 11 treesize of output 11 [2024-12-02 14:11:58,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:11:58,540 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-12-02 14:11:58,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:11:58,547 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 38 treesize of output 27 [2024-12-02 14:11:58,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:11:58,575 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-12-02 14:11:58,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 50 [2024-12-02 14:11:58,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:11:58,585 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 29 treesize of output 11 [2024-12-02 14:11:58,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:11:58,776 INFO L349 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2024-12-02 14:11:58,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 130 treesize of output 83 [2024-12-02 14:11:58,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:11:58,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 62 [2024-12-02 14:12:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 19 proven. 59 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-12-02 14:12:49,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:12:49,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:12:49,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 76 [2024-12-02 14:12:49,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:12:49,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 70 [2024-12-02 14:12:49,934 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_pop_front_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_59| Int)) (or (forall ((v_ArrVal_2381 Int) (v_ArrVal_2374 (Array Int Int)) (v_arrayElimArr_31 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_2374) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_59| v_arrayElimArr_31))) (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_2381))) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_59| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_59| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_59| 1)) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_prenex_117 Int) (v_ArrVal_2375 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_2375) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_59| v_arrayElimArr_32))) (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_prenex_117))) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2024-12-02 14:12:50,164 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:12:50,164 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:12:50,248 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-12-02 14:12:50,248 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 4255 treesize of output 3078 [2024-12-02 14:12:50,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:12:50,279 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 540 treesize of output 536 [2024-12-02 14:12:50,289 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 575 treesize of output 535 [2024-12-02 14:12:50,302 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 583 treesize of output 563 [2024-12-02 14:12:50,316 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:12:50,317 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:12:50,390 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-12-02 14:12:50,390 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 765 treesize of output 758 [2024-12-02 14:12:50,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:12:50,425 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 1034 treesize of output 1006 [2024-12-02 14:12:50,445 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 989 treesize of output 969 [2024-12-02 14:12:50,466 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 1065 treesize of output 1025 [2024-12-02 14:12:54,084 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-12-02 14:12:54,131 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-12-02 14:12:54,294 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:12:54,295 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:12:54,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:12:54,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 330 treesize of output 338 [2024-12-02 14:12:56,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:12:56,262 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 867 treesize of output 771 [2024-12-02 14:12:57,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416374360] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:12:57,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 14:12:57,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2024-12-02 14:12:57,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869335206] [2024-12-02 14:12:57,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 14:12:57,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-12-02 14:12:57,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:12:57,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-12-02 14:12:57,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1292, Unknown=3, NotChecked=72, Total=1482 [2024-12-02 14:12:57,892 INFO L87 Difference]: Start difference. First operand 893 states and 1116 transitions. Second operand has 29 states, 29 states have (on average 4.931034482758621) internal successors, (143), 29 states have internal predecessors, (143), 13 states have call successors, (35), 4 states have call predecessors, (35), 5 states have return successors, (34), 12 states have call predecessors, (34), 13 states have call successors, (34) [2024-12-02 14:13:01,981 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-12-02 14:13:05,988 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]