./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d7c0f5b67426dc3769ace794e9c8c036d37ffa3960449e6b59343c653ea0c545 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:47:45,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:47:45,330 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-13 14:47:45,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:47:45,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:47:45,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:47:45,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:47:45,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:47:45,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:47:45,377 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:47:45,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:47:45,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:47:45,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:47:45,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:47:45,378 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:47:45,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:47:45,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:47:45,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:47:45,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:47:45,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:47:45,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:47:45,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:47:45,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:47:45,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:47:45,379 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:47:45,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:47:45,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:47:45,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:47:45,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:47:45,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:47:45,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:47:45,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:47:45,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:47:45,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:47:45,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:47:45,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:47:45,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:47:45,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:47:45,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:47:45,385 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_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7c0f5b67426dc3769ace794e9c8c036d37ffa3960449e6b59343c653ea0c545 [2024-11-13 14:47:45,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:47:45,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:47:45,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:47:45,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:47:45,832 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:47:45,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i Unable to find full path for "g++" [2024-11-13 14:47:48,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:47:48,928 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:47:48,930 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i [2024-11-13 14:47:48,980 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/data/a894ccee9/1bd2b9774fb64c829e2b2374cf7df396/FLAG6aac85690 [2024-11-13 14:47:49,000 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/data/a894ccee9/1bd2b9774fb64c829e2b2374cf7df396 [2024-11-13 14:47:49,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:47:49,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:47:49,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:47:49,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:47:49,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:47:49,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:47:49" (1/1) ... [2024-11-13 14:47:49,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba3b105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:49, skipping insertion in model container [2024-11-13 14:47:49,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:47:49" (1/1) ... [2024-11-13 14:47:49,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:47:49,530 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_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4493,4506] [2024-11-13 14:47:49,539 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_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4553,4566] [2024-11-13 14:47:50,833 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:50,834 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:50,835 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:50,836 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:50,837 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:50,858 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:50,859 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:50,861 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:50,862 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:50,865 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:50,866 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:50,867 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:50,868 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:51,682 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:51,683 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:51,694 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:51,710 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:51,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:47:51,884 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:47:51,901 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_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4493,4506] [2024-11-13 14:47:51,901 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_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4553,4566] [2024-11-13 14:47:52,055 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,055 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,056 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,056 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,057 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,072 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,075 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,080 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,080 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,084 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,085 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,086 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,086 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,233 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,233 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,235 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,241 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:47:52,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7775-7786] [2024-11-13 14:47:52,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:47:52,607 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:47:52,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:52 WrapperNode [2024-11-13 14:47:52,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:47:52,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:47:52,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:47:52,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:47:52,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:52" (1/1) ... [2024-11-13 14:47:52,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:52" (1/1) ... [2024-11-13 14:47:52,839 INFO L138 Inliner]: procedures = 680, calls = 1678, calls flagged for inlining = 52, calls inlined = 7, statements flattened = 718 [2024-11-13 14:47:52,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:47:52,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:47:52,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:47:52,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:47:52,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:52" (1/1) ... [2024-11-13 14:47:52,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:52" (1/1) ... [2024-11-13 14:47:52,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:52" (1/1) ... [2024-11-13 14:47:52,988 INFO L175 MemorySlicer]: Split 313 memory accesses to 5 slices as follows [238, 2, 57, 9, 7]. 76 percent of accesses are in the largest equivalence class. The 24 initializations are split as follows [6, 2, 10, 1, 5]. The 241 writes are split as follows [232, 0, 7, 1, 1]. [2024-11-13 14:47:52,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:52" (1/1) ... [2024-11-13 14:47:52,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:52" (1/1) ... [2024-11-13 14:47:53,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:52" (1/1) ... [2024-11-13 14:47:53,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:52" (1/1) ... [2024-11-13 14:47:53,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:52" (1/1) ... [2024-11-13 14:47:53,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:52" (1/1) ... [2024-11-13 14:47:53,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:47:53,071 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:47:53,071 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:47:53,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:47:53,073 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:52" (1/1) ... [2024-11-13 14:47:53,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:47:53,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:47:53,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:47:53,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:47:53,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 14:47:53,165 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2024-11-13 14:47:53,166 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2024-11-13 14:47:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2024-11-13 14:47:53,166 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2024-11-13 14:47:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-11-13 14:47:53,166 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-11-13 14:47:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2024-11-13 14:47:53,166 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2024-11-13 14:47:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-13 14:47:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-13 14:47:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-13 14:47:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-13 14:47:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-13 14:47:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 14:47:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 14:47:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 14:47:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 14:47:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 14:47:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-11-13 14:47:53,168 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-11-13 14:47:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 14:47:53,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 14:47:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 14:47:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:47:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 14:47:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 14:47:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 14:47:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-13 14:47:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-13 14:47:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2024-11-13 14:47:53,170 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2024-11-13 14:47:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:47:53,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:47:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-11-13 14:47:53,170 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-11-13 14:47:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2024-11-13 14:47:53,170 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2024-11-13 14:47:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-13 14:47:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-13 14:47:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-13 14:47:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-13 14:47:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-13 14:47:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2024-11-13 14:47:53,171 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2024-11-13 14:47:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2024-11-13 14:47:53,171 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2024-11-13 14:47:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:47:53,172 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:47:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2024-11-13 14:47:53,172 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2024-11-13 14:47:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2024-11-13 14:47:53,172 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2024-11-13 14:47:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 14:47:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 14:47:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 14:47:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 14:47:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-13 14:47:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-13 14:47:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 14:47:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 14:47:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 14:47:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-13 14:47:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-13 14:47:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-11-13 14:47:53,173 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-11-13 14:47:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2024-11-13 14:47:53,173 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2024-11-13 14:47:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 14:47:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 14:47:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 14:47:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 14:47:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 14:47:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2024-11-13 14:47:53,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2024-11-13 14:47:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:47:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:47:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 14:47:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 14:47:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 14:47:53,628 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:47:53,630 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:48:00,815 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-13 14:48:00,818 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:48:00,841 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:48:00,842 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 14:48:00,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:48:00 BoogieIcfgContainer [2024-11-13 14:48:00,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:48:00,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:48:00,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:48:00,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:48:00,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:47:49" (1/3) ... [2024-11-13 14:48:00,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8bec66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:48:00, skipping insertion in model container [2024-11-13 14:48:00,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:52" (2/3) ... [2024-11-13 14:48:00,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8bec66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:48:00, skipping insertion in model container [2024-11-13 14:48:00,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:48:00" (3/3) ... [2024-11-13 14:48:00,856 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_array_list_copy_harness.i [2024-11-13 14:48:00,876 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:48:00,878 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_array_list_copy_harness.i that has 18 procedures, 209 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-13 14:48:00,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:48:00,984 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;@1773373c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:48:00,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:48:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 119 states have (on average 1.184873949579832) internal successors, (141), 120 states have internal predecessors, (141), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-13 14:48:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 14:48:01,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:01,017 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:48:01,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:01,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:01,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1329126664, now seen corresponding path program 1 times [2024-11-13 14:48:01,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:01,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722471168] [2024-11-13 14:48:01,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:01,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:48:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-13 14:48:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:48:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:48:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:48:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:48:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 14:48:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:48:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:48:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:48:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:48:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 14:48:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 14:48:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 14:48:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:48:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:48:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:48:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 14:48:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:48:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 14:48:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 14:48:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 14:48:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:48:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 14:48:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2024-11-13 14:48:11,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:11,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722471168] [2024-11-13 14:48:11,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722471168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:11,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:11,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:48:11,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751241324] [2024-11-13 14:48:11,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:11,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:48:11,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:11,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:48:11,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:48:11,246 INFO L87 Difference]: Start difference. First operand has 209 states, 119 states have (on average 1.184873949579832) internal successors, (141), 120 states have internal predecessors, (141), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-13 14:48:15,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:19,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:24,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:30,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:30,501 INFO L93 Difference]: Finished difference Result 442 states and 648 transitions. [2024-11-13 14:48:30,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:48:30,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2024-11-13 14:48:30,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:30,527 INFO L225 Difference]: With dead ends: 442 [2024-11-13 14:48:30,527 INFO L226 Difference]: Without dead ends: 232 [2024-11-13 14:48:30,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:48:30,544 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 215 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 272 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:30,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 239 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 336 Invalid, 3 Unknown, 0 Unchecked, 18.6s Time] [2024-11-13 14:48:30,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-13 14:48:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 204. [2024-11-13 14:48:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 115 states have (on average 1.173913043478261) internal successors, (135), 116 states have internal predecessors, (135), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-13 14:48:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 276 transitions. [2024-11-13 14:48:30,657 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 276 transitions. Word has length 145 [2024-11-13 14:48:30,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:30,658 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 276 transitions. [2024-11-13 14:48:30,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-13 14:48:30,658 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 276 transitions. [2024-11-13 14:48:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 14:48:30,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:30,663 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:48:30,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:48:30,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:30,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash -433130932, now seen corresponding path program 1 times [2024-11-13 14:48:30,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:30,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600997997] [2024-11-13 14:48:30,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:30,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:38,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:48:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:38,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-13 14:48:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:38,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:48:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:38,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:48:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:38,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:48:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:38,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:48:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 14:48:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:48:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:48:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:48:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:48:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 14:48:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 14:48:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 14:48:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:48:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:48:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:48:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 14:48:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:48:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 14:48:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 14:48:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 14:48:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:48:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 14:48:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:39,578 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-13 14:48:39,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:39,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600997997] [2024-11-13 14:48:39,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600997997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:48:39,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807100124] [2024-11-13 14:48:39,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:39,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:48:39,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:48:39,584 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:48:39,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:48:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:47,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 4363 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:48:47,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:48:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-13 14:48:47,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:48:47,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807100124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:47,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:48:47,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-13 14:48:47,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875277646] [2024-11-13 14:48:47,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:47,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:48:47,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:47,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:48:47,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:48:47,640 INFO L87 Difference]: Start difference. First operand 204 states and 276 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-13 14:48:47,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:47,754 INFO L93 Difference]: Finished difference Result 403 states and 547 transitions. [2024-11-13 14:48:47,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:48:47,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2024-11-13 14:48:47,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:47,759 INFO L225 Difference]: With dead ends: 403 [2024-11-13 14:48:47,759 INFO L226 Difference]: Without dead ends: 205 [2024-11-13 14:48:47,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:48:47,762 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 546 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.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:47,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 546 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:48:47,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-13 14:48:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-13 14:48:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 116 states have (on average 1.1724137931034482) internal successors, (136), 117 states have internal predecessors, (136), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-13 14:48:47,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 277 transitions. [2024-11-13 14:48:47,832 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 277 transitions. Word has length 145 [2024-11-13 14:48:47,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:47,833 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 277 transitions. [2024-11-13 14:48:47,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-13 14:48:47,834 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 277 transitions. [2024-11-13 14:48:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 14:48:47,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:47,843 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:48:47,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:48:48,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:48:48,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:48,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:48,044 INFO L85 PathProgramCache]: Analyzing trace with hash 995250632, now seen corresponding path program 1 times [2024-11-13 14:48:48,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:48,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662962363] [2024-11-13 14:48:48,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:48,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:55,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:48:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:55,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-13 14:48:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:56,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:48:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:56,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:48:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:56,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:48:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:56,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:56,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:48:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:56,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 14:48:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:56,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:48:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:48:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:48:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:48:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 14:48:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 14:48:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 14:48:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:48:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:48:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:48:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 14:48:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:48:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 14:48:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 14:48:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 14:48:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:48:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 14:48:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2024-11-13 14:48:57,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:57,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662962363] [2024-11-13 14:48:57,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662962363] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:48:57,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571872038] [2024-11-13 14:48:57,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:57,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:48:57,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:48:57,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:48:57,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:49:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:05,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 4369 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:49:05,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-13 14:49:06,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:49:06,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571872038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:06,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:49:06,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-13 14:49:06,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845970939] [2024-11-13 14:49:06,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:06,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:49:06,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:06,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:49:06,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:49:06,432 INFO L87 Difference]: Start difference. First operand 205 states and 277 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-13 14:49:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:09,584 INFO L93 Difference]: Finished difference Result 405 states and 558 transitions. [2024-11-13 14:49:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:49:09,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 145 [2024-11-13 14:49:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:09,588 INFO L225 Difference]: With dead ends: 405 [2024-11-13 14:49:09,589 INFO L226 Difference]: Without dead ends: 207 [2024-11-13 14:49:09,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:49:09,591 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 282 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:09,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 779 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-13 14:49:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-13 14:49:09,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-13 14:49:09,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 117 states have (on average 1.170940170940171) internal successors, (137), 119 states have internal predecessors, (137), 71 states have call successors, (71), 17 states have call predecessors, (71), 18 states have return successors, (82), 70 states have call predecessors, (82), 70 states have call successors, (82) [2024-11-13 14:49:09,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 290 transitions. [2024-11-13 14:49:09,633 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 290 transitions. Word has length 145 [2024-11-13 14:49:09,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:09,634 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 290 transitions. [2024-11-13 14:49:09,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-13 14:49:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 290 transitions. [2024-11-13 14:49:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 14:49:09,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:09,637 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:09,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:49:09,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:09,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:09,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:09,839 INFO L85 PathProgramCache]: Analyzing trace with hash -139108393, now seen corresponding path program 1 times [2024-11-13 14:49:09,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:09,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839141130] [2024-11-13 14:49:09,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:09,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:16,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:49:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:16,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-13 14:49:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:17,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:49:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:17,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:49:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:17,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:49:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:17,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:49:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:17,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:49:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:17,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:49:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:17,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:49:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:17,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:49:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:49:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:49:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:49:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:49:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:49:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 14:49:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 14:49:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:49:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-13 14:49:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:49:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 14:49:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-13 14:49:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-13 14:49:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:49:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-13 14:49:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-11-13 14:49:18,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:18,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839141130] [2024-11-13 14:49:18,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839141130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:18,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737747515] [2024-11-13 14:49:18,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:18,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:18,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:49:18,667 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:49:18,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:49:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:26,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 4496 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:49:26,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-13 14:49:27,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:49:27,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737747515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:27,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:49:27,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-13 14:49:27,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872896988] [2024-11-13 14:49:27,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:27,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:49:27,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:27,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:49:27,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:49:27,671 INFO L87 Difference]: Start difference. First operand 207 states and 290 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-13 14:49:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:31,244 INFO L93 Difference]: Finished difference Result 380 states and 530 transitions. [2024-11-13 14:49:31,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:49:31,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 160 [2024-11-13 14:49:31,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:31,249 INFO L225 Difference]: With dead ends: 380 [2024-11-13 14:49:31,249 INFO L226 Difference]: Without dead ends: 207 [2024-11-13 14:49:31,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:49:31,252 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 280 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:31,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 782 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-13 14:49:31,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-13 14:49:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-13 14:49:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 117 states have (on average 1.170940170940171) internal successors, (137), 119 states have internal predecessors, (137), 71 states have call successors, (71), 17 states have call predecessors, (71), 18 states have return successors, (80), 70 states have call predecessors, (80), 70 states have call successors, (80) [2024-11-13 14:49:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2024-11-13 14:49:31,288 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 160 [2024-11-13 14:49:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:31,289 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2024-11-13 14:49:31,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-13 14:49:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2024-11-13 14:49:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 14:49:31,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:31,293 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2024-11-13 14:49:31,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 14:49:31,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:31,494 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:31,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:31,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1577477002, now seen corresponding path program 2 times [2024-11-13 14:49:31,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:31,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519252194] [2024-11-13 14:49:31,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:31,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:38,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:49:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:38,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-13 14:49:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:39,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:49:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:39,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:49:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:39,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:49:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:39,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:49:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:39,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:49:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:39,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:49:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:39,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:49:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:39,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:49:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:39,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:39,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:39,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:49:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:39,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:49:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:39,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:49:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:40,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:49:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:40,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:49:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:40,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 14:49:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:40,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 14:49:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:40,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 14:49:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:40,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 14:49:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:40,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-13 14:49:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:40,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 14:49:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:40,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:49:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:40,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-13 14:49:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:40,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 14:49:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:40,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-13 14:49:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:40,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:49:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:40,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-13 14:49:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-13 14:49:40,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:40,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519252194] [2024-11-13 14:49:40,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519252194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:40,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050710441] [2024-11-13 14:49:40,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:49:40,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:40,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:49:40,655 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:49:40,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:49:48,524 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 14:49:48,524 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:49:48,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 3932 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 14:49:48,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-11-13 14:49:49,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:49:49,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050710441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:49,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:49:49,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-13 14:49:49,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554472779] [2024-11-13 14:49:49,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:49,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:49:49,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:49,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:49:49,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:49:49,348 INFO L87 Difference]: Start difference. First operand 207 states and 288 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-13 14:49:49,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:49,595 INFO L93 Difference]: Finished difference Result 266 states and 364 transitions. [2024-11-13 14:49:49,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:49:49,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 175 [2024-11-13 14:49:49,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:49,600 INFO L225 Difference]: With dead ends: 266 [2024-11-13 14:49:49,600 INFO L226 Difference]: Without dead ends: 212 [2024-11-13 14:49:49,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:49:49,602 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:49,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1086 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:49:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-13 14:49:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-13 14:49:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 121 states have (on average 1.165289256198347) internal successors, (141), 123 states have internal predecessors, (141), 71 states have call successors, (71), 17 states have call predecessors, (71), 19 states have return successors, (82), 71 states have call predecessors, (82), 70 states have call successors, (82) [2024-11-13 14:49:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2024-11-13 14:49:49,636 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 175 [2024-11-13 14:49:49,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:49,637 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2024-11-13 14:49:49,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-13 14:49:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2024-11-13 14:49:49,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-13 14:49:49,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:49,641 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:49,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-13 14:49:49,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:49,842 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:49,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:49,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1443434910, now seen corresponding path program 1 times [2024-11-13 14:49:49,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:49,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133396185] [2024-11-13 14:49:49,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:49,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:49:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-13 14:49:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:49:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:49:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:49:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:49:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:49:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:49:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:49:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:49:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:49:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:49:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:49:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:49:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:49:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 14:49:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 14:49:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 14:49:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 14:49:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-13 14:49:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 14:49:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:49:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-13 14:49:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 14:49:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-13 14:49:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:49:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-13 14:49:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 14:49:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-13 14:49:59,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:59,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133396185] [2024-11-13 14:49:59,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133396185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:59,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429731911] [2024-11-13 14:49:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:59,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:59,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:49:59,284 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:49:59,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:50:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:07,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 4627 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 14:50:07,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-13 14:50:09,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:50:09,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429731911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:50:09,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:50:09,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2024-11-13 14:50:09,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186316006] [2024-11-13 14:50:09,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:09,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:50:09,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:50:09,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:50:09,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:50:09,679 INFO L87 Difference]: Start difference. First operand 212 states and 294 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-13 14:50:14,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:14,101 INFO L93 Difference]: Finished difference Result 379 states and 521 transitions. [2024-11-13 14:50:14,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:50:14,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 181 [2024-11-13 14:50:14,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:14,105 INFO L225 Difference]: With dead ends: 379 [2024-11-13 14:50:14,106 INFO L226 Difference]: Without dead ends: 212 [2024-11-13 14:50:14,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-13 14:50:14,108 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 308 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:14,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 945 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-13 14:50:14,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-13 14:50:14,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-13 14:50:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 121 states have (on average 1.165289256198347) internal successors, (141), 123 states have internal predecessors, (141), 71 states have call successors, (71), 17 states have call predecessors, (71), 19 states have return successors, (77), 71 states have call predecessors, (77), 70 states have call successors, (77) [2024-11-13 14:50:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 289 transitions. [2024-11-13 14:50:14,141 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 289 transitions. Word has length 181 [2024-11-13 14:50:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:14,142 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 289 transitions. [2024-11-13 14:50:14,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-13 14:50:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 289 transitions. [2024-11-13 14:50:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-13 14:50:14,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:14,146 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:14,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:50:14,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-13 14:50:14,347 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:14,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:14,347 INFO L85 PathProgramCache]: Analyzing trace with hash 447772293, now seen corresponding path program 1 times [2024-11-13 14:50:14,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:50:14,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483921059] [2024-11-13 14:50:14,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:14,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:50:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:50:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-13 14:50:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:50:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:50:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:50:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:50:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:50:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:50:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:50:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:50:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:50:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:50:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:50:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:50:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:50:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:50:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:50:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:24,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 14:50:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 14:50:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:24,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 14:50:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:24,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 14:50:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:24,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-13 14:50:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:24,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 14:50:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:24,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:50:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:24,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:50:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:24,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 14:50:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:24,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 14:50:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:24,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 14:50:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:24,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-13 14:50:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:24,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:50:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:24,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-13 14:50:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2024-11-13 14:50:24,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:50:24,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483921059] [2024-11-13 14:50:24,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483921059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:50:24,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:50:24,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 14:50:24,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696467140] [2024-11-13 14:50:24,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:24,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:50:24,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:50:24,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:50:24,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:50:24,629 INFO L87 Difference]: Start difference. First operand 212 states and 289 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 6 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-13 14:50:28,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:33,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:37,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:41,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:58,288 INFO L93 Difference]: Finished difference Result 411 states and 561 transitions. [2024-11-13 14:50:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 14:50:58,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 6 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 195 [2024-11-13 14:50:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:58,291 INFO L225 Difference]: With dead ends: 411 [2024-11-13 14:50:58,291 INFO L226 Difference]: Without dead ends: 245 [2024-11-13 14:50:58,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-13 14:50:58,295 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 250 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 216 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:58,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 572 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1049 Invalid, 4 Unknown, 0 Unchecked, 31.4s Time] [2024-11-13 14:50:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-13 14:50:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 210. [2024-11-13 14:50:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 120 states have (on average 1.1583333333333334) internal successors, (139), 121 states have internal predecessors, (139), 71 states have call successors, (71), 17 states have call predecessors, (71), 18 states have return successors, (72), 71 states have call predecessors, (72), 70 states have call successors, (72) [2024-11-13 14:50:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 282 transitions. [2024-11-13 14:50:58,325 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 282 transitions. Word has length 195 [2024-11-13 14:50:58,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:58,326 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 282 transitions. [2024-11-13 14:50:58,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 6 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-13 14:50:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 282 transitions. [2024-11-13 14:50:58,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-13 14:50:58,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:58,330 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:58,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:50:58,331 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:58,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:58,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1713877896, now seen corresponding path program 1 times [2024-11-13 14:50:58,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:50:58,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283452591] [2024-11-13 14:50:58,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:51:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:04,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:51:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:04,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-13 14:51:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:05,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:51:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:05,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:51:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:05,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:51:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:05,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:51:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:05,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:51:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:05,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:51:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:05,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:51:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:05,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:51:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:05,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:51:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:05,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:51:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:05,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:51:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:05,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:51:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:05,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:51:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:51:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:51:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 14:51:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 14:51:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 14:51:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 14:51:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-13 14:51:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 14:51:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:51:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:51:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 14:51:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 14:51:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:51:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:51:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-13 14:51:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-13 14:51:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:51:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-13 14:51:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2024-11-13 14:51:06,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:51:06,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283452591] [2024-11-13 14:51:06,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283452591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:51:06,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:51:06,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 14:51:06,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224224387] [2024-11-13 14:51:06,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:51:06,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:51:06,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:51:06,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:51:06,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:51:06,573 INFO L87 Difference]: Start difference. First operand 210 states and 282 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (25), 6 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-13 14:51:10,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:51:15,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:51:19,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:51:23,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:51:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:40,790 INFO L93 Difference]: Finished difference Result 294 states and 395 transitions. [2024-11-13 14:51:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:51:40,791 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (25), 6 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) Word has length 210 [2024-11-13 14:51:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:40,795 INFO L225 Difference]: With dead ends: 294 [2024-11-13 14:51:40,795 INFO L226 Difference]: Without dead ends: 247 [2024-11-13 14:51:40,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:51:40,797 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 225 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 263 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:40,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 818 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1028 Invalid, 4 Unknown, 0 Unchecked, 32.8s Time] [2024-11-13 14:51:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-13 14:51:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2024-11-13 14:51:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 122 states have (on average 1.1557377049180328) internal successors, (141), 123 states have internal predecessors, (141), 71 states have call successors, (71), 17 states have call predecessors, (71), 18 states have return successors, (72), 71 states have call predecessors, (72), 70 states have call successors, (72) [2024-11-13 14:51:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 284 transitions. [2024-11-13 14:51:40,835 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 284 transitions. Word has length 210 [2024-11-13 14:51:40,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:40,836 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 284 transitions. [2024-11-13 14:51:40,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (25), 6 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-13 14:51:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 284 transitions. [2024-11-13 14:51:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-13 14:51:40,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:40,842 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:40,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:51:40,842 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:40,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:40,843 INFO L85 PathProgramCache]: Analyzing trace with hash -561213031, now seen corresponding path program 1 times [2024-11-13 14:51:40,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:51:40,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386876456] [2024-11-13 14:51:40,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:40,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:51:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:59,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:51:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:59,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-13 14:51:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:59,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:51:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:00,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:52:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:00,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:52:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:01,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:52:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:01,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:52:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:01,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:52:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:01,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:52:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:01,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:52:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:01,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:52:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:01,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:52:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:02,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:52:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:02,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:52:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:02,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:52:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:02,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:52:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:02,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:52:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:02,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 14:52:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:02,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 14:52:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:02,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 14:52:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 14:52:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:03,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-13 14:52:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:03,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 14:52:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:03,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:52:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:03,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:52:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:03,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 14:52:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:03,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 14:52:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:03,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:52:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:03,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:52:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:03,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-13 14:52:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:03,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-13 14:52:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:03,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:52:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:04,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-13 14:52:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:04,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-13 14:52:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:04,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:52:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:04,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:52:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 21 proven. 20 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2024-11-13 14:52:04,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:04,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386876456] [2024-11-13 14:52:04,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386876456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:52:04,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009808974] [2024-11-13 14:52:04,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:04,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:52:04,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:52:04,109 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:52:04,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:52:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:13,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 5008 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-13 14:52:13,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:52:13,474 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 10 treesize of output 8 [2024-11-13 14:52:16,569 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_ensure_array_list_has_allocated_data_member_~list.offset_8 Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |c_ensure_array_list_has_allocated_data_member_#in~list.base| (store (select |c_old(#memory_$Pointer$#2.base)| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_8 (select (select |c_#memory_$Pointer$#2.base| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_8))) |c_#memory_$Pointer$#2.base|) (<= v_ensure_array_list_has_allocated_data_member_~list.offset_8 |c_ensure_array_list_has_allocated_data_member_#in~list.offset|) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_ensure_array_list_has_allocated_data_member_#in~list.base| (store (select |c_old(#memory_$Pointer$#2.offset)| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_8 (select (select |c_#memory_$Pointer$#2.offset| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_8))) |c_#memory_$Pointer$#2.offset|))) is different from true [2024-11-13 14:52:16,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:52:16,730 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 25 treesize of output 13 [2024-11-13 14:52:16,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:52:16,781 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 25 treesize of output 13 [2024-11-13 14:52:29,017 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (or (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (not (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base| .cse0)) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0))) is different from false [2024-11-13 14:52:29,037 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (or (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (not (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base| .cse0)) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0))) is different from true [2024-11-13 14:52:33,233 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse1)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0))))) is different from false [2024-11-13 14:52:33,254 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse1)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0))))) is different from true [2024-11-13 14:52:41,074 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse2)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0))) is different from false [2024-11-13 14:52:41,094 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse2)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0))) is different from true [2024-11-13 14:52:45,323 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse2)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from false [2024-11-13 14:52:45,342 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse2)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from true [2024-11-13 14:52:50,424 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse3)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0))) is different from false [2024-11-13 14:52:50,444 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse3)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0))) is different from true [2024-11-13 14:52:55,033 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse3)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from false [2024-11-13 14:52:55,053 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse3)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from true [2024-11-13 14:53:00,232 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse2) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse4)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse5 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse5) 0))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse2) 0))) is different from false [2024-11-13 14:53:00,250 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse2) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse4)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse5 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse5) 0))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse2) 0))) is different from true [2024-11-13 14:53:06,112 INFO L349 Elim1Store]: treesize reduction 36, result has 70.2 percent of original size [2024-11-13 14:53:06,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 139 [2024-11-13 14:53:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 293 proven. 37 refuted. 2 times theorem prover too weak. 127 trivial. 55 not checked. [2024-11-13 14:53:06,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:53:12,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009808974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:53:12,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:53:12,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24] total 31 [2024-11-13 14:53:12,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036865179] [2024-11-13 14:53:12,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:53:12,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-13 14:53:12,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:12,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-13 14:53:12,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=509, Unknown=24, NotChecked=424, Total=1056 [2024-11-13 14:53:12,612 INFO L87 Difference]: Start difference. First operand 212 states and 284 transitions. Second operand has 31 states, 27 states have (on average 4.814814814814815) internal successors, (130), 22 states have internal predecessors, (130), 13 states have call successors, (54), 11 states have call predecessors, (54), 13 states have return successors, (54), 13 states have call predecessors, (54), 13 states have call successors, (54) [2024-11-13 14:53:16,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:53:21,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:53:25,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:53:51,413 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0))) (and (or (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (not (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base| .cse0)) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0)))) .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0) (not (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0#1.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) .cse2))) is different from false [2024-11-13 14:53:51,433 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0))) (and (or (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (not (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base| .cse0)) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0)))) .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0) (not (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0#1.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) .cse2))) is different from true [2024-11-13 14:53:55,437 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_real#3)| |c_#memory_real#3|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse1)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0))))) (= |c_old(#memory_int#3)| |c_#memory_int#3|) (= |c_old(#memory_$Pointer$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#memory_real#2)| |c_#memory_real#2|) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from false [2024-11-13 14:53:55,456 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_real#3)| |c_#memory_real#3|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse1)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0))))) (= |c_old(#memory_int#3)| |c_#memory_int#3|) (= |c_old(#memory_$Pointer$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#memory_real#2)| |c_#memory_real#2|) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from true [2024-11-13 14:53:55,478 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (= |c_old(#memory_real#3)| |c_#memory_real#3|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse1)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0))))) (= |c_old(#memory_int#3)| |c_#memory_int#3|) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from false [2024-11-13 14:53:55,498 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (= |c_old(#memory_real#3)| |c_#memory_real#3|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse1)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0))))) (= |c_old(#memory_int#3)| |c_#memory_int#3|) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from true [2024-11-13 14:53:59,529 WARN L851 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse2)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from false [2024-11-13 14:53:59,560 WARN L873 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse2)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from true [2024-11-13 14:54:03,564 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse2)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0))))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0))) is different from false [2024-11-13 14:54:03,582 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse2)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0))))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0))) is different from true [2024-11-13 14:54:07,587 WARN L851 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse3)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from false [2024-11-13 14:54:07,607 WARN L873 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse3)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from true [2024-11-13 14:54:11,611 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse3)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0))))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0))) is different from false [2024-11-13 14:54:11,631 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (not (= |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| .cse3)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0))))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0))) is different from true [2024-11-13 14:54:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:54:29,741 INFO L93 Difference]: Finished difference Result 535 states and 706 transitions. [2024-11-13 14:54:29,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-13 14:54:29,742 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 4.814814814814815) internal successors, (130), 22 states have internal predecessors, (130), 13 states have call successors, (54), 11 states have call predecessors, (54), 13 states have return successors, (54), 13 states have call predecessors, (54), 13 states have call successors, (54) Word has length 226 [2024-11-13 14:54:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:54:29,747 INFO L225 Difference]: With dead ends: 535 [2024-11-13 14:54:29,747 INFO L226 Difference]: Without dead ends: 320 [2024-11-13 14:54:29,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 420 SyntacticMatches, 11 SemanticMatches, 64 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 71.4s TimeCoverageRelationStatistics Valid=460, Invalid=2112, Unknown=38, NotChecked=1680, Total=4290 [2024-11-13 14:54:29,751 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 733 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 2187 mSolverCounterSat, 603 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 7315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 603 IncrementalHoareTripleChecker+Valid, 2187 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 4522 IncrementalHoareTripleChecker+Unchecked, 44.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:54:29,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 810 Invalid, 7315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [603 Valid, 2187 Invalid, 3 Unknown, 4522 Unchecked, 44.0s Time] [2024-11-13 14:54:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-13 14:54:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 271. [2024-11-13 14:54:29,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 160 states have (on average 1.15625) internal successors, (185), 163 states have internal predecessors, (185), 83 states have call successors, (83), 26 states have call predecessors, (83), 27 states have return successors, (86), 81 states have call predecessors, (86), 82 states have call successors, (86) [2024-11-13 14:54:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 354 transitions. [2024-11-13 14:54:29,798 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 354 transitions. Word has length 226 [2024-11-13 14:54:29,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:54:29,798 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 354 transitions. [2024-11-13 14:54:29,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 4.814814814814815) internal successors, (130), 22 states have internal predecessors, (130), 13 states have call successors, (54), 11 states have call predecessors, (54), 13 states have return successors, (54), 13 states have call predecessors, (54), 13 states have call successors, (54) [2024-11-13 14:54:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 354 transitions. [2024-11-13 14:54:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 14:54:29,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:54:29,802 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:54:29,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 14:54:30,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-13 14:54:30,003 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:54:30,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:54:30,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1525028899, now seen corresponding path program 1 times [2024-11-13 14:54:30,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:54:30,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050035617] [2024-11-13 14:54:30,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:54:30,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:54:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:44,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:54:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:44,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-13 14:54:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:44,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:54:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:54:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:45,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:54:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:46,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:54:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:46,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:54:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:46,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:54:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:46,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:54:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:46,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:54:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:46,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:54:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:46,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:54:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:47,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:54:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:47,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:54:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:47,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 14:54:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:47,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:54:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:54:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:54:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 14:54:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 14:54:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 14:54:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-13 14:54:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 14:54:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:54:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:54:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:54:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 14:54:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-13 14:54:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:54:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:54:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-13 14:54:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-13 14:54:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:48,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:54:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:49,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-13 14:54:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:49,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-13 14:54:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:49,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:54:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:49,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:54:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2024-11-13 14:54:49,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:54:49,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050035617] [2024-11-13 14:54:49,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050035617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:54:49,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582807083] [2024-11-13 14:54:49,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:54:49,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:54:49,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:54:49,051 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:54:49,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:54:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:56,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 5045 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-13 14:54:56,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:54:56,425 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 10 treesize of output 8 [2024-11-13 14:54:58,994 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_ensure_array_list_has_allocated_data_member_~list.offset_12 Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |c_ensure_array_list_has_allocated_data_member_#in~list.base| (store (select |c_old(#memory_$Pointer$#2.base)| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_12 (select (select |c_#memory_$Pointer$#2.base| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_12))) |c_#memory_$Pointer$#2.base|) (<= v_ensure_array_list_has_allocated_data_member_~list.offset_12 |c_ensure_array_list_has_allocated_data_member_#in~list.offset|) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |c_ensure_array_list_has_allocated_data_member_#in~list.base| (store (select |c_old(#memory_$Pointer$#2.offset)| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_12 (select (select |c_#memory_$Pointer$#2.offset| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_12)))))) is different from true [2024-11-13 14:54:59,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:54:59,132 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 25 treesize of output 13 [2024-11-13 14:54:59,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:54:59,199 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 25 treesize of output 13 [2024-11-13 14:55:03,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 14:55:03,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 14:55:09,320 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 9 treesize of output 3 [2024-11-13 14:55:09,344 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 9 treesize of output 3 [2024-11-13 14:55:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 302 proven. 41 refuted. 0 times theorem prover too weak. 162 trivial. 2 not checked. [2024-11-13 14:55:09,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:55:31,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582807083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:55:31,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:55:31,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 26 [2024-11-13 14:55:31,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115877184] [2024-11-13 14:55:31,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:55:31,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 14:55:31,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:55:31,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 14:55:31,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=809, Unknown=12, NotChecked=58, Total=992 [2024-11-13 14:55:31,334 INFO L87 Difference]: Start difference. First operand 271 states and 354 transitions. Second operand has 26 states, 24 states have (on average 4.916666666666667) internal successors, (118), 19 states have internal predecessors, (118), 10 states have call successors, (54), 9 states have call predecessors, (54), 10 states have return successors, (52), 9 states have call predecessors, (52), 10 states have call successors, (52) [2024-11-13 14:55:35,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:55:39,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:55:44,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:55:48,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:56:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:56:41,476 INFO L93 Difference]: Finished difference Result 544 states and 712 transitions. [2024-11-13 14:56:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-13 14:56:41,477 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.916666666666667) internal successors, (118), 19 states have internal predecessors, (118), 10 states have call successors, (54), 9 states have call predecessors, (54), 10 states have return successors, (52), 9 states have call predecessors, (52), 10 states have call successors, (52) Word has length 232 [2024-11-13 14:56:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:56:41,480 INFO L225 Difference]: With dead ends: 544 [2024-11-13 14:56:41,481 INFO L226 Difference]: Without dead ends: 265 [2024-11-13 14:56:41,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 419 SyntacticMatches, 17 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 40.5s TimeCoverageRelationStatistics Valid=505, Invalid=2908, Unknown=13, NotChecked=114, Total=3540 [2024-11-13 14:56:41,484 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 680 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 2685 mSolverCounterSat, 574 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 3689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 2685 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 426 IncrementalHoareTripleChecker+Unchecked, 54.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:56:41,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 936 Invalid, 3689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 2685 Invalid, 4 Unknown, 426 Unchecked, 54.7s Time] [2024-11-13 14:56:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-13 14:56:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 230. [2024-11-13 14:56:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 134 states have (on average 1.1492537313432836) internal successors, (154), 136 states have internal predecessors, (154), 73 states have call successors, (73), 21 states have call predecessors, (73), 22 states have return successors, (75), 72 states have call predecessors, (75), 72 states have call successors, (75) [2024-11-13 14:56:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 302 transitions. [2024-11-13 14:56:41,523 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 302 transitions. Word has length 232 [2024-11-13 14:56:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:56:41,524 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 302 transitions. [2024-11-13 14:56:41,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.916666666666667) internal successors, (118), 19 states have internal predecessors, (118), 10 states have call successors, (54), 9 states have call predecessors, (54), 10 states have return successors, (52), 9 states have call predecessors, (52), 10 states have call successors, (52) [2024-11-13 14:56:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 302 transitions. [2024-11-13 14:56:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 14:56:41,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:56:41,526 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:56:41,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 14:56:41,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 14:56:41,726 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:56:41,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:56:41,727 INFO L85 PathProgramCache]: Analyzing trace with hash -524063787, now seen corresponding path program 2 times [2024-11-13 14:56:41,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:56:41,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484031024] [2024-11-13 14:56:41,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:56:41,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:56:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:54,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:56:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:54,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-13 14:56:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:54,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:56:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:56,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:56:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:56,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:56:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:56,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 14:56:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:57,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:56:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:59,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:56:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:59,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:56:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:59,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:56:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:59,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 14:56:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:59,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:56:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:59,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:56:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:59,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:56:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:59,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 14:56:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:59,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:56:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:59,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:56:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:57:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 14:57:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 14:57:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 14:57:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-13 14:57:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 14:57:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:57:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:57:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:57:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 14:57:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-13 14:57:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:57:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:57:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-13 14:57:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-13 14:57:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:57:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-13 14:57:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-13 14:57:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:57:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:57:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2024-11-13 14:57:00,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:57:00,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484031024] [2024-11-13 14:57:00,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484031024] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:57:00,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753551383] [2024-11-13 14:57:00,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:57:00,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:57:00,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:57:00,625 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:57:00,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d248c1a6-c0a8-4523-8478-c7c6418a1d9a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process