./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d7c0f5b67426dc3769ace794e9c8c036d37ffa3960449e6b59343c653ea0c545 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:39:07,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:39:07,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 14:39:07,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:39:07,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:39:07,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:39:07,355 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:39:07,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:39:07,356 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:39:07,356 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:39:07,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:39:07,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:39:07,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:39:07,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:39:07,359 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:39:07,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:39:07,360 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:39:07,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:39:07,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:39:07,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:39:07,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:39:07,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:39:07,388 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:39:07,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:39:07,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:39:07,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:39:07,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:39:07,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:39:07,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:39:07,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:39:07,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:39:07,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:39:07,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:39:07,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:39:07,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:39:07,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:39:07,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:39:07,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:39:07,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:39:07,391 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7c0f5b67426dc3769ace794e9c8c036d37ffa3960449e6b59343c653ea0c545 [2024-10-11 14:39:07,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:39:07,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:39:07,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:39:07,612 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:39:07,613 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:39:07,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i [2024-10-11 14:39:08,804 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:39:09,141 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:39:09,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i [2024-10-11 14:39:09,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/703106881/bf4d7864582d42d7abae601c694b8650/FLAG876b3a81e [2024-10-11 14:39:09,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/703106881/bf4d7864582d42d7abae601c694b8650 [2024-10-11 14:39:09,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:39:09,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:39:09,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:39:09,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:39:09,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:39:09,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:39:09" (1/1) ... [2024-10-11 14:39:09,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bcd533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:09, skipping insertion in model container [2024-10-11 14:39:09,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:39:09" (1/1) ... [2024-10-11 14:39:09,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:39:09,691 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4493,4506] [2024-10-11 14:39:09,697 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4553,4566] [2024-10-11 14:39:10,207 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,208 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,208 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,209 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,209 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,218 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,219 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,220 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,221 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,222 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,223 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,223 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,223 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,471 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,471 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,479 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,489 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:39:10,565 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:39:10,577 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4493,4506] [2024-10-11 14:39:10,578 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4553,4566] [2024-10-11 14:39:10,629 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,631 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,632 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,632 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,633 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,640 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,642 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,643 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,643 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,644 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,647 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,647 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,647 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,711 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,712 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,713 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,716 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:10,719 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7775-7786] [2024-10-11 14:39:10,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:39:10,998 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:39:11,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:11 WrapperNode [2024-10-11 14:39:11,001 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:39:11,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:39:11,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:39:11,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:39:11,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:11" (1/1) ... [2024-10-11 14:39:11,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:11" (1/1) ... [2024-10-11 14:39:11,112 INFO L138 Inliner]: procedures = 680, calls = 1672, calls flagged for inlining = 52, calls inlined = 7, statements flattened = 716 [2024-10-11 14:39:11,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:39:11,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:39:11,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:39:11,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:39:11,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:11" (1/1) ... [2024-10-11 14:39:11,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:11" (1/1) ... [2024-10-11 14:39:11,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:11" (1/1) ... [2024-10-11 14:39:11,167 INFO L175 MemorySlicer]: Split 311 memory accesses to 5 slices as follows [236, 2, 57, 7, 9]. 76 percent of accesses are in the largest equivalence class. The 254 initializations are split as follows [236, 2, 10, 5, 1]. The 9 writes are split as follows [0, 0, 7, 1, 1]. [2024-10-11 14:39:11,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:11" (1/1) ... [2024-10-11 14:39:11,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:11" (1/1) ... [2024-10-11 14:39:11,183 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:11" (1/1) ... [2024-10-11 14:39:11,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:11" (1/1) ... [2024-10-11 14:39:11,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:11" (1/1) ... [2024-10-11 14:39:11,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:11" (1/1) ... [2024-10-11 14:39:11,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:39:11,198 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:39:11,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:39:11,198 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:39:11,198 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:11" (1/1) ... [2024-10-11 14:39:11,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:39:11,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:39:11,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:39:11,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:39:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 14:39:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2024-10-11 14:39:11,254 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2024-10-11 14:39:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2024-10-11 14:39:11,254 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2024-10-11 14:39:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-10-11 14:39:11,254 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-10-11 14:39:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2024-10-11 14:39:11,255 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2024-10-11 14:39:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:39:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:39:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 14:39:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 14:39:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 14:39:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-10-11 14:39:11,255 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-10-11 14:39:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 14:39:11,256 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 14:39:11,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 14:39:11,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:39:11,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 14:39:11,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 14:39:11,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 14:39:11,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 14:39:11,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 14:39:11,256 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2024-10-11 14:39:11,256 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2024-10-11 14:39:11,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:39:11,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:39:11,257 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-10-11 14:39:11,257 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-10-11 14:39:11,257 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2024-10-11 14:39:11,257 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2024-10-11 14:39:11,257 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2024-10-11 14:39:11,257 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2024-10-11 14:39:11,257 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2024-10-11 14:39:11,257 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2024-10-11 14:39:11,257 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:39:11,258 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:39:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2024-10-11 14:39:11,258 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2024-10-11 14:39:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2024-10-11 14:39:11,258 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2024-10-11 14:39:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 14:39:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 14:39:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 14:39:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 14:39:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 14:39:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 14:39:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 14:39:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 14:39:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 14:39:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 14:39:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 14:39:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-10-11 14:39:11,259 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-10-11 14:39:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2024-10-11 14:39:11,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2024-10-11 14:39:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:39:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:39:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 14:39:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 14:39:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 14:39:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2024-10-11 14:39:11,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2024-10-11 14:39:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:39:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:39:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 14:39:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 14:39:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 14:39:11,435 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:39:11,437 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:39:11,948 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-10-11 14:39:11,948 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:39:12,011 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:39:12,011 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 14:39:12,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:12 BoogieIcfgContainer [2024-10-11 14:39:12,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:39:12,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:39:12,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:39:12,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:39:12,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:39:09" (1/3) ... [2024-10-11 14:39:12,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86d4b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:39:12, skipping insertion in model container [2024-10-11 14:39:12,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:11" (2/3) ... [2024-10-11 14:39:12,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86d4b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:39:12, skipping insertion in model container [2024-10-11 14:39:12,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:12" (3/3) ... [2024-10-11 14:39:12,017 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_array_list_copy_harness.i [2024-10-11 14:39:12,028 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:39:12,028 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:39:12,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:39:12,079 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;@4d1b4536, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:39:12,080 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:39:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 101 states have (on average 1.2178217821782178) internal successors, (123), 102 states have internal predecessors, (123), 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-10-11 14:39:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 14:39:12,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:12,099 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 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] [2024-10-11 14:39:12,100 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:12,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:12,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1865167207, now seen corresponding path program 1 times [2024-10-11 14:39:12,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:12,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100541356] [2024-10-11 14:39:12,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:12,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:39:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:39:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:39:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 14:39:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 14:39:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 14:39:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 14:39:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:39:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 14:39:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 14:39:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 14:39:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 14:39:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 14:39:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 14:39:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 14:39:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 14:39:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 14:39:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:39:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 14:39:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-10-11 14:39:12,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:12,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100541356] [2024-10-11 14:39:12,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100541356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:39:12,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:39:12,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:39:12,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043063654] [2024-10-11 14:39:12,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:39:12,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:39:12,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:39:12,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:39:12,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:39:12,993 INFO L87 Difference]: Start difference. First operand has 191 states, 101 states have (on average 1.2178217821782178) internal successors, (123), 102 states have internal predecessors, (123), 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 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 14:39:14,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:39:14,750 INFO L93 Difference]: Finished difference Result 400 states and 607 transitions. [2024-10-11 14:39:14,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:39:14,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 138 [2024-10-11 14:39:14,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:39:14,761 INFO L225 Difference]: With dead ends: 400 [2024-10-11 14:39:14,761 INFO L226 Difference]: Without dead ends: 210 [2024-10-11 14:39:14,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:39:14,767 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 105 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:39:14,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 385 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 14:39:14,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-11 14:39:14,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 190. [2024-10-11 14:39:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 101 states have (on average 1.198019801980198) internal successors, (121), 102 states have internal predecessors, (121), 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-10-11 14:39:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 262 transitions. [2024-10-11 14:39:14,823 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 262 transitions. Word has length 138 [2024-10-11 14:39:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:39:14,823 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 262 transitions. [2024-10-11 14:39:14,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 14:39:14,824 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 262 transitions. [2024-10-11 14:39:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 14:39:14,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:14,827 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 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] [2024-10-11 14:39:14,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:39:14,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:14,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:14,827 INFO L85 PathProgramCache]: Analyzing trace with hash -484384081, now seen corresponding path program 1 times [2024-10-11 14:39:14,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:14,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422983741] [2024-10-11 14:39:14,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:14,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:39:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:39:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:39:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 14:39:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 14:39:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 14:39:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 14:39:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:39:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 14:39:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 14:39:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 14:39:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 14:39:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 14:39:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 14:39:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 14:39:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 14:39:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 14:39:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:39:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 14:39:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-10-11 14:39:15,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:15,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422983741] [2024-10-11 14:39:15,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422983741] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:39:15,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143589069] [2024-10-11 14:39:15,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:15,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:39:15,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:39:15,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:39:15,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:39:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:15,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 2321 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 14:39:15,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:39:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-11 14:39:15,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:39:15,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143589069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:39:15,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 14:39:15,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-11 14:39:15,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798499726] [2024-10-11 14:39:15,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:39:15,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:39:15,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:39:15,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:39:15,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:39:15,836 INFO L87 Difference]: Start difference. First operand 190 states and 262 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10-11 14:39:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:39:16,407 INFO L93 Difference]: Finished difference Result 376 states and 529 transitions. [2024-10-11 14:39:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:39:16,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 138 [2024-10-11 14:39:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:39:16,410 INFO L225 Difference]: With dead ends: 376 [2024-10-11 14:39:16,410 INFO L226 Difference]: Without dead ends: 192 [2024-10-11 14:39:16,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:39:16,417 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 54 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:39:16,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 778 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:39:16,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-11 14:39:16,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-10-11 14:39:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 102 states have (on average 1.196078431372549) internal successors, (122), 104 states have internal predecessors, (122), 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-10-11 14:39:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 275 transitions. [2024-10-11 14:39:16,434 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 275 transitions. Word has length 138 [2024-10-11 14:39:16,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:39:16,435 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 275 transitions. [2024-10-11 14:39:16,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10-11 14:39:16,435 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 275 transitions. [2024-10-11 14:39:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 14:39:16,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:16,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:39:16,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:39:16,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:39:16,638 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:16,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:16,639 INFO L85 PathProgramCache]: Analyzing trace with hash 158567647, now seen corresponding path program 1 times [2024-10-11 14:39:16,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:16,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495373741] [2024-10-11 14:39:16,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:16,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:16,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:16,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:39:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:16,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:39:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:16,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:16,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:16,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:39:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:39:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:39:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:39:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:39:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 14:39:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:39:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:39:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:39:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:39:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:39:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:39:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 14:39:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 14:39:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 14:39:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 14:39:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 14:39:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 14:39:17,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:17,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495373741] [2024-10-11 14:39:17,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495373741] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:39:17,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420234250] [2024-10-11 14:39:17,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:17,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:39:17,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:39:17,163 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:39:17,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:39:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:17,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 2456 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 14:39:17,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:39:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-11 14:39:17,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:39:17,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420234250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:39:17,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 14:39:17,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-11 14:39:17,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977727930] [2024-10-11 14:39:17,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:39:17,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:39:17,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:39:17,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:39:17,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:39:17,761 INFO L87 Difference]: Start difference. First operand 192 states and 275 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-11 14:39:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:39:18,166 INFO L93 Difference]: Finished difference Result 352 states and 502 transitions. [2024-10-11 14:39:18,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:39:18,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 151 [2024-10-11 14:39:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:39:18,169 INFO L225 Difference]: With dead ends: 352 [2024-10-11 14:39:18,169 INFO L226 Difference]: Without dead ends: 192 [2024-10-11 14:39:18,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:39:18,174 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 52 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:39:18,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 787 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:39:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-11 14:39:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-10-11 14:39:18,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 102 states have (on average 1.196078431372549) internal successors, (122), 104 states have internal predecessors, (122), 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-10-11 14:39:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 273 transitions. [2024-10-11 14:39:18,213 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 273 transitions. Word has length 151 [2024-10-11 14:39:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:39:18,214 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 273 transitions. [2024-10-11 14:39:18,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-11 14:39:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 273 transitions. [2024-10-11 14:39:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 14:39:18,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:18,221 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:39:18,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 14:39:18,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:39:18,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:18,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:18,422 INFO L85 PathProgramCache]: Analyzing trace with hash -693379247, now seen corresponding path program 2 times [2024-10-11 14:39:18,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:18,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330894025] [2024-10-11 14:39:18,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:18,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:39:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:39:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:39:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:39:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:39:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:39:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:39:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 14:39:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 14:39:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:18,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 14:39:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:19,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 14:39:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:19,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 14:39:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:19,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 14:39:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:19,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 14:39:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:19,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 14:39:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:19,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 14:39:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:19,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 14:39:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:19,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 14:39:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:19,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:19,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 14:39:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-10-11 14:39:19,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:19,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330894025] [2024-10-11 14:39:19,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330894025] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:39:19,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950035937] [2024-10-11 14:39:19,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:39:19,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:39:19,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:39:19,113 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:39:19,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 14:39:19,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 14:39:19,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:39:19,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 1899 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 14:39:19,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:39:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-10-11 14:39:19,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:39:19,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950035937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:39:19,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 14:39:19,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-11 14:39:19,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439899657] [2024-10-11 14:39:19,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:39:19,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:39:19,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:39:19,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:39:19,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:39:19,529 INFO L87 Difference]: Start difference. First operand 192 states and 273 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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-10-11 14:39:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:39:20,213 INFO L93 Difference]: Finished difference Result 246 states and 344 transitions. [2024-10-11 14:39:20,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:39:20,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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 164 [2024-10-11 14:39:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:39:20,215 INFO L225 Difference]: With dead ends: 246 [2024-10-11 14:39:20,215 INFO L226 Difference]: Without dead ends: 196 [2024-10-11 14:39:20,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:39:20,216 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 14:39:20,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 974 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 14:39:20,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-11 14:39:20,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-10-11 14:39:20,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 105 states have (on average 1.1904761904761905) internal successors, (125), 107 states have internal predecessors, (125), 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-10-11 14:39:20,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 278 transitions. [2024-10-11 14:39:20,230 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 278 transitions. Word has length 164 [2024-10-11 14:39:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:39:20,231 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 278 transitions. [2024-10-11 14:39:20,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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-10-11 14:39:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 278 transitions. [2024-10-11 14:39:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 14:39:20,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:20,233 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:39:20,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 14:39:20,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:39:20,437 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:20,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:20,437 INFO L85 PathProgramCache]: Analyzing trace with hash -802147734, now seen corresponding path program 1 times [2024-10-11 14:39:20,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:20,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641285667] [2024-10-11 14:39:20,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:20,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:39:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:39:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:39:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:39:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:39:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:39:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:39:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 14:39:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 14:39:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 14:39:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 14:39:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 14:39:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 14:39:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 14:39:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 14:39:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 14:39:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 14:39:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 14:39:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:39:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:20,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 14:39:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:21,006 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-10-11 14:39:21,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:21,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641285667] [2024-10-11 14:39:21,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641285667] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:39:21,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719213557] [2024-10-11 14:39:21,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:21,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:39:21,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:39:21,009 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:39:21,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 14:39:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:21,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 2588 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 14:39:21,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:39:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 14:39:21,464 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:39:21,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719213557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:39:21,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 14:39:21,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-10-11 14:39:21,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107113619] [2024-10-11 14:39:21,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:39:21,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:39:21,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:39:21,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:39:21,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:39:21,466 INFO L87 Difference]: Start difference. First operand 196 states and 278 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-10-11 14:39:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:39:22,378 INFO L93 Difference]: Finished difference Result 349 states and 491 transitions. [2024-10-11 14:39:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:39:22,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 168 [2024-10-11 14:39:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:39:22,380 INFO L225 Difference]: With dead ends: 349 [2024-10-11 14:39:22,380 INFO L226 Difference]: Without dead ends: 196 [2024-10-11 14:39:22,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:39:22,381 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 80 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:39:22,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 954 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 14:39:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-11 14:39:22,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-10-11 14:39:22,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 105 states have (on average 1.1904761904761905) internal successors, (125), 107 states have internal predecessors, (125), 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-10-11 14:39:22,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 273 transitions. [2024-10-11 14:39:22,393 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 273 transitions. Word has length 168 [2024-10-11 14:39:22,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:39:22,394 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 273 transitions. [2024-10-11 14:39:22,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-10-11 14:39:22,394 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 273 transitions. [2024-10-11 14:39:22,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-11 14:39:22,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:22,395 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:39:22,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 14:39:22,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:39:22,596 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:22,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:22,597 INFO L85 PathProgramCache]: Analyzing trace with hash 648275094, now seen corresponding path program 1 times [2024-10-11 14:39:22,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:22,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570013473] [2024-10-11 14:39:22,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:22,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:22,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:22,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:39:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:22,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:39:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:22,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:22,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:22,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:39:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:22,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:39:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:39:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:39:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:39:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 14:39:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 14:39:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 14:39:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 14:39:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 14:39:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 14:39:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 14:39:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 14:39:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 14:39:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 14:39:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 14:39:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 14:39:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-10-11 14:39:23,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:23,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570013473] [2024-10-11 14:39:23,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570013473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:39:23,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:39:23,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:39:23,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117903919] [2024-10-11 14:39:23,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:39:23,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:39:23,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:39:23,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:39:23,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:39:23,222 INFO L87 Difference]: Start difference. First operand 196 states and 273 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 6 states have internal predecessors, (48), 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-10-11 14:39:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:39:24,979 INFO L93 Difference]: Finished difference Result 375 states and 525 transitions. [2024-10-11 14:39:24,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 14:39:24,980 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 6 states have internal predecessors, (48), 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 180 [2024-10-11 14:39:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:39:24,983 INFO L225 Difference]: With dead ends: 375 [2024-10-11 14:39:24,983 INFO L226 Difference]: Without dead ends: 223 [2024-10-11 14:39:24,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:39:24,985 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 217 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:39:24,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 659 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 14:39:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-11 14:39:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 194. [2024-10-11 14:39:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 104 states have (on average 1.1826923076923077) internal successors, (123), 105 states have internal predecessors, (123), 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-10-11 14:39:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 266 transitions. [2024-10-11 14:39:25,012 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 266 transitions. Word has length 180 [2024-10-11 14:39:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:39:25,013 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 266 transitions. [2024-10-11 14:39:25,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 6 states have internal predecessors, (48), 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-10-11 14:39:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 266 transitions. [2024-10-11 14:39:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-11 14:39:25,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:25,016 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:39:25,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:39:25,017 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:25,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:25,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1901556210, now seen corresponding path program 1 times [2024-10-11 14:39:25,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:25,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301366861] [2024-10-11 14:39:25,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:25,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:39:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:39:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:39:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:39:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:39:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:39:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:39:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 14:39:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 14:39:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 14:39:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 14:39:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 14:39:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 14:39:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 14:39:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 14:39:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 14:39:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 14:39:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 14:39:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 14:39:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2024-10-11 14:39:25,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:25,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301366861] [2024-10-11 14:39:25,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301366861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:39:25,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:39:25,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:39:25,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988827521] [2024-10-11 14:39:25,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:39:25,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:39:25,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:39:25,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:39:25,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:39:25,684 INFO L87 Difference]: Start difference. First operand 194 states and 266 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 5 states have internal predecessors, (45), 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-10-11 14:39:28,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:39:28,010 INFO L93 Difference]: Finished difference Result 267 states and 368 transitions. [2024-10-11 14:39:28,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:39:28,011 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 5 states have internal predecessors, (45), 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 193 [2024-10-11 14:39:28,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:39:28,013 INFO L225 Difference]: With dead ends: 267 [2024-10-11 14:39:28,013 INFO L226 Difference]: Without dead ends: 225 [2024-10-11 14:39:28,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:39:28,014 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 125 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:39:28,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 873 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 14:39:28,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-11 14:39:28,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 196. [2024-10-11 14:39:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 106 states have (on average 1.179245283018868) internal successors, (125), 107 states have internal predecessors, (125), 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-10-11 14:39:28,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 268 transitions. [2024-10-11 14:39:28,030 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 268 transitions. Word has length 193 [2024-10-11 14:39:28,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:39:28,030 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 268 transitions. [2024-10-11 14:39:28,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 5 states have internal predecessors, (45), 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-10-11 14:39:28,030 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 268 transitions. [2024-10-11 14:39:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-11 14:39:28,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:28,033 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:39:28,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:39:28,033 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:28,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:28,033 INFO L85 PathProgramCache]: Analyzing trace with hash -176118346, now seen corresponding path program 1 times [2024-10-11 14:39:28,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:28,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893306285] [2024-10-11 14:39:28,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:28,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:30,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:30,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:39:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:39:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:39:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:39:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:39:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:39:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:39:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 14:39:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 14:39:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 14:39:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 14:39:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 14:39:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 14:39:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 14:39:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 14:39:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 14:39:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 14:39:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 14:39:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:39:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 14:39:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 21 proven. 20 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-10-11 14:39:31,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:31,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893306285] [2024-10-11 14:39:31,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893306285] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:39:31,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431344710] [2024-10-11 14:39:31,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:31,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:39:31,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:39:31,659 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:39:31,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 14:39:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:32,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 2993 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-11 14:39:32,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:39:32,242 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-10-11 14:39:32,580 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-10-11 14:39:32,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:39:32,627 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-10-11 14:39:32,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:39:32,644 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-10-11 14:39:37,660 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-10-11 14:39:37,670 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-10-11 14:39:41,686 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-10-11 14:39:41,689 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-10-11 14:39:46,004 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-10-11 14:39:46,007 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-10-11 14:39:50,029 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-10-11 14:39:50,031 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-10-11 14:39:54,114 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-10-11 14:39:54,116 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-10-11 14:39:58,173 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-10-11 14:39:58,176 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-10-11 14:40:02,272 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-10-11 14:40:02,275 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-10-11 14:40:06,389 INFO L349 Elim1Store]: treesize reduction 36, result has 70.2 percent of original size [2024-10-11 14:40:06,390 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-10-11 14:40:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 277 proven. 37 refuted. 2 times theorem prover too weak. 113 trivial. 53 not checked. [2024-10-11 14:40:06,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:40:06,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431344710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:40:06,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:40:06,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24] total 31 [2024-10-11 14:40:06,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150243584] [2024-10-11 14:40:06,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 14:40:06,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 14:40:06,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:06,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 14:40:06,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=504, Unknown=29, NotChecked=424, Total=1056 [2024-10-11 14:40:06,799 INFO L87 Difference]: Start difference. First operand 196 states and 268 transitions. Second operand has 31 states, 27 states have (on average 4.222222222222222) internal successors, (114), 22 states have internal predecessors, (114), 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-10-11 14:40:10,420 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-10-11 14:40:10,422 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-10-11 14:40:14,425 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-10-11 14:40:14,428 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-10-11 14:40:18,435 WARN L851 $PredicateComparison]: unable to prove that (and (= |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)|) (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_$Pointer$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from false [2024-10-11 14:40:18,438 WARN L873 $PredicateComparison]: unable to prove that (and (= |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)|) (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_$Pointer$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from true [2024-10-11 14:40:22,441 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (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(#length)| |c_#length|)) is different from false [2024-10-11 14:40:22,444 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (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(#length)| |c_#length|)) is different from true [2024-10-11 14:40:26,452 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-10-11 14:40:26,456 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-10-11 14:40:30,462 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-10-11 14:40:30,465 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-10-11 14:40:34,469 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-10-11 14:40:34,472 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-10-11 14:40:38,476 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-10-11 14:40:38,479 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-10-11 14:40:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:39,918 INFO L93 Difference]: Finished difference Result 489 states and 660 transitions. [2024-10-11 14:40:39,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-11 14:40:39,919 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 4.222222222222222) internal successors, (114), 22 states have internal predecessors, (114), 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 207 [2024-10-11 14:40:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:39,922 INFO L225 Difference]: With dead ends: 489 [2024-10-11 14:40:39,922 INFO L226 Difference]: Without dead ends: 290 [2024-10-11 14:40:39,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 385 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 57.7s TimeCoverageRelationStatistics Valid=393, Invalid=1787, Unknown=46, NotChecked=1680, Total=3906 [2024-10-11 14:40:39,924 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 337 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 6946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4222 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:39,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 965 Invalid, 6946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 2369 Invalid, 0 Unknown, 4222 Unchecked, 4.1s Time] [2024-10-11 14:40:39,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-11 14:40:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 248. [2024-10-11 14:40:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 137 states have (on average 1.1824817518248176) internal successors, (162), 140 states have internal predecessors, (162), 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-10-11 14:40:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 331 transitions. [2024-10-11 14:40:39,946 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 331 transitions. Word has length 207 [2024-10-11 14:40:39,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:39,948 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 331 transitions. [2024-10-11 14:40:39,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 4.222222222222222) internal successors, (114), 22 states have internal predecessors, (114), 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-10-11 14:40:39,948 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 331 transitions. [2024-10-11 14:40:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-11 14:40:39,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:39,950 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2024-10-11 14:40:39,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 14:40:40,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:40,151 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:40,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:40,152 INFO L85 PathProgramCache]: Analyzing trace with hash -801953572, now seen corresponding path program 1 times [2024-10-11 14:40:40,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:40,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893973556] [2024-10-11 14:40:40,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:40,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:40:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 14:40:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:40:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:40:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:40:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:40:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:40:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:40:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:40:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:40:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:40:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:40:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:40:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:40:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:40:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:40:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:40:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 14:40:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 14:40:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:40:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 14:40:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 14:40:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:40:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 14:40:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 14:40:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:40:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 14:40:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat