./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 06:05:33,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 06:05:33,447 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-12-02 06:05:33,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 06:05:33,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 06:05:33,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 06:05:33,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 06:05:33,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 06:05:33,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 06:05:33,476 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 06:05:33,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 06:05:33,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 06:05:33,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 06:05:33,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 06:05:33,477 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 06:05:33,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 06:05:33,477 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 06:05:33,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 06:05:33,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 06:05:33,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 06:05:33,478 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 06:05:33,478 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 06:05:33,478 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 06:05:33,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 06:05:33,478 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 06:05:33,478 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 06:05:33,478 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 06:05:33,478 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 06:05:33,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 06:05:33,478 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 06:05:33,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 06:05:33,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 06:05:33,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 06:05:33,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 06:05:33,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 06:05:33,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 06:05:33,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 06:05:33,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 06:05:33,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 06:05:33,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 06:05:33,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 06:05:33,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 06:05:33,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 06:05:33,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 06:05:33,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 06:05:33,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 06:05:33,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 06:05:33,480 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-12-02 06:05:33,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 06:05:33,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 06:05:33,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 06:05:33,726 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 06:05:33,726 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 06:05:33,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-1.i [2024-12-02 06:05:36,362 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/data/1335c00ea/52f1fbd7a09f4671a0bba2628d07dddd/FLAGeb5b7dd78 [2024-12-02 06:05:36,629 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 06:05:36,629 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-1.i [2024-12-02 06:05:36,641 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/data/1335c00ea/52f1fbd7a09f4671a0bba2628d07dddd/FLAGeb5b7dd78 [2024-12-02 06:05:36,946 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/data/1335c00ea/52f1fbd7a09f4671a0bba2628d07dddd [2024-12-02 06:05:36,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 06:05:36,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 06:05:36,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 06:05:36,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 06:05:36,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 06:05:36,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:05:36" (1/1) ... [2024-12-02 06:05:36,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cbeeb0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:36, skipping insertion in model container [2024-12-02 06:05:36,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:05:36" (1/1) ... [2024-12-02 06:05:36,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 06:05:37,235 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 06:05:37,264 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 06:05:37,266 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 06:05:37,269 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 06:05:37,274 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 06:05:37,283 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 06:05:37,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 06:05:37,293 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 06:05:37,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 06:05:37,393 INFO L204 MainTranslator]: Completed translation [2024-12-02 06:05:37,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:37 WrapperNode [2024-12-02 06:05:37,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 06:05:37,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 06:05:37,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 06:05:37,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 06:05:37,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:37" (1/1) ... [2024-12-02 06:05:37,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:37" (1/1) ... [2024-12-02 06:05:37,440 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 787 [2024-12-02 06:05:37,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 06:05:37,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 06:05:37,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 06:05:37,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 06:05:37,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:37" (1/1) ... [2024-12-02 06:05:37,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:37" (1/1) ... [2024-12-02 06:05:37,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:37" (1/1) ... [2024-12-02 06:05:37,491 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-12-02 06:05:37,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:37" (1/1) ... [2024-12-02 06:05:37,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:37" (1/1) ... [2024-12-02 06:05:37,515 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:37" (1/1) ... [2024-12-02 06:05:37,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:37" (1/1) ... [2024-12-02 06:05:37,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:37" (1/1) ... [2024-12-02 06:05:37,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:37" (1/1) ... [2024-12-02 06:05:37,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:37" (1/1) ... [2024-12-02 06:05:37,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 06:05:37,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 06:05:37,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 06:05:37,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 06:05:37,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:37" (1/1) ... [2024-12-02 06:05:37,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 06:05:37,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:05:37,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 06:05:37,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 06:05:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-12-02 06:05:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-12-02 06:05:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-12-02 06:05:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-12-02 06:05:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-12-02 06:05:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-12-02 06:05:37,592 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-12-02 06:05:37,592 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-12-02 06:05:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 06:05:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 06:05:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-12-02 06:05:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-12-02 06:05:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-12-02 06:05:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-12-02 06:05:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-02 06:05:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 06:05:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 06:05:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 06:05:37,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 06:05:37,741 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 06:05:37,743 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 06:05:37,746 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-12-02 06:05:37,782 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-12-02 06:05:39,139 INFO L? ?]: Removed 762 outVars from TransFormulas that were not future-live. [2024-12-02 06:05:39,139 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 06:05:39,160 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 06:05:39,160 INFO L312 CfgBuilder]: Removed 18 assume(true) statements. [2024-12-02 06:05:39,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:05:39 BoogieIcfgContainer [2024-12-02 06:05:39,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 06:05:39,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 06:05:39,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 06:05:39,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 06:05:39,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:05:36" (1/3) ... [2024-12-02 06:05:39,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d838a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:05:39, skipping insertion in model container [2024-12-02 06:05:39,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:37" (2/3) ... [2024-12-02 06:05:39,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d838a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:05:39, skipping insertion in model container [2024-12-02 06:05:39,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:05:39" (3/3) ... [2024-12-02 06:05:39,170 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test1-1.i [2024-12-02 06:05:39,185 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 06:05:39,186 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test1-1.i that has 3 procedures, 743 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2024-12-02 06:05:39,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 06:05:39,245 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=None, 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;@12e4ecbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 06:05:39,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-12-02 06:05:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 738 states, 416 states have (on average 2.0600961538461537) internal successors, (857), 733 states have internal predecessors, (857), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:05:39,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-02 06:05:39,254 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:39,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 06:05:39,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:39,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:39,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103276, now seen corresponding path program 1 times [2024-12-02 06:05:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:39,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142414876] [2024-12-02 06:05:39,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:39,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:39,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:39,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142414876] [2024-12-02 06:05:39,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142414876] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:39,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:39,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:05:39,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331917639] [2024-12-02 06:05:39,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:39,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 06:05:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:39,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 06:05:39,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 06:05:39,383 INFO L87 Difference]: Start difference. First operand has 738 states, 416 states have (on average 2.0600961538461537) internal successors, (857), 733 states have internal predecessors, (857), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:39,442 INFO L93 Difference]: Finished difference Result 728 states and 816 transitions. [2024-12-02 06:05:39,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 06:05:39,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-12-02 06:05:39,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:39,454 INFO L225 Difference]: With dead ends: 728 [2024-12-02 06:05:39,454 INFO L226 Difference]: Without dead ends: 726 [2024-12-02 06:05:39,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 06:05:39,459 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:39,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:05:39,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-12-02 06:05:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2024-12-02 06:05:39,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 410 states have (on average 1.9707317073170731) internal successors, (808), 721 states have internal predecessors, (808), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:05:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 814 transitions. [2024-12-02 06:05:39,519 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 814 transitions. Word has length 6 [2024-12-02 06:05:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:39,519 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 814 transitions. [2024-12-02 06:05:39,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 814 transitions. [2024-12-02 06:05:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-02 06:05:39,519 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:39,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 06:05:39,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 06:05:39,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:39,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:39,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103338, now seen corresponding path program 1 times [2024-12-02 06:05:39,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:39,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348958509] [2024-12-02 06:05:39,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:39,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:39,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:39,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348958509] [2024-12-02 06:05:39,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348958509] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:39,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:39,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:05:39,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979152969] [2024-12-02 06:05:39,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:39,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:05:39,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:39,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:05:39,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:05:39,596 INFO L87 Difference]: Start difference. First operand 726 states and 814 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:40,160 INFO L93 Difference]: Finished difference Result 680 states and 769 transitions. [2024-12-02 06:05:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:05:40,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-12-02 06:05:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:40,164 INFO L225 Difference]: With dead ends: 680 [2024-12-02 06:05:40,164 INFO L226 Difference]: Without dead ends: 680 [2024-12-02 06:05:40,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:05:40,165 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 679 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:40,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 469 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 06:05:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-12-02 06:05:40,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 677. [2024-12-02 06:05:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 410 states have (on average 1.851219512195122) internal successors, (759), 672 states have internal predecessors, (759), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:05:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 765 transitions. [2024-12-02 06:05:40,188 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 765 transitions. Word has length 6 [2024-12-02 06:05:40,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:40,188 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 765 transitions. [2024-12-02 06:05:40,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:40,188 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 765 transitions. [2024-12-02 06:05:40,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-02 06:05:40,189 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:40,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 06:05:40,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 06:05:40,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:40,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:40,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103339, now seen corresponding path program 1 times [2024-12-02 06:05:40,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:40,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421348936] [2024-12-02 06:05:40,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:40,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:40,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:40,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421348936] [2024-12-02 06:05:40,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421348936] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:40,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:40,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:05:40,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059531702] [2024-12-02 06:05:40,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:40,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:05:40,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:40,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:05:40,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:05:40,282 INFO L87 Difference]: Start difference. First operand 677 states and 765 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:40,730 INFO L93 Difference]: Finished difference Result 755 states and 849 transitions. [2024-12-02 06:05:40,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:05:40,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-12-02 06:05:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:40,733 INFO L225 Difference]: With dead ends: 755 [2024-12-02 06:05:40,734 INFO L226 Difference]: Without dead ends: 755 [2024-12-02 06:05:40,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:05:40,735 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 417 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:40,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 831 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 06:05:40,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-12-02 06:05:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 706. [2024-12-02 06:05:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 450 states have (on average 1.8377777777777777) internal successors, (827), 701 states have internal predecessors, (827), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:05:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 833 transitions. [2024-12-02 06:05:40,757 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 833 transitions. Word has length 6 [2024-12-02 06:05:40,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:40,757 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 833 transitions. [2024-12-02 06:05:40,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 833 transitions. [2024-12-02 06:05:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-02 06:05:40,757 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:40,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 06:05:40,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 06:05:40,758 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:40,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:40,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1423421085, now seen corresponding path program 1 times [2024-12-02 06:05:40,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:40,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877178450] [2024-12-02 06:05:40,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:40,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:40,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:40,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877178450] [2024-12-02 06:05:40,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877178450] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:40,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:40,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:05:40,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286080210] [2024-12-02 06:05:40,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:40,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:05:40,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:40,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:05:40,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:05:40,790 INFO L87 Difference]: Start difference. First operand 706 states and 833 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:40,828 INFO L93 Difference]: Finished difference Result 1388 states and 1641 transitions. [2024-12-02 06:05:40,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:05:40,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-12-02 06:05:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:40,835 INFO L225 Difference]: With dead ends: 1388 [2024-12-02 06:05:40,835 INFO L226 Difference]: Without dead ends: 1388 [2024-12-02 06:05:40,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:05:40,836 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 722 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:40,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1500 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:05:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-12-02 06:05:40,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 707. [2024-12-02 06:05:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 451 states have (on average 1.835920177383592) internal successors, (828), 702 states have internal predecessors, (828), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:05:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 834 transitions. [2024-12-02 06:05:40,864 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 834 transitions. Word has length 6 [2024-12-02 06:05:40,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:40,864 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 834 transitions. [2024-12-02 06:05:40,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 834 transitions. [2024-12-02 06:05:40,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-02 06:05:40,865 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:40,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:40,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 06:05:40,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:40,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:40,865 INFO L85 PathProgramCache]: Analyzing trace with hash 247711511, now seen corresponding path program 1 times [2024-12-02 06:05:40,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:40,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523459391] [2024-12-02 06:05:40,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:40,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:40,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:40,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523459391] [2024-12-02 06:05:40,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523459391] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:40,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:40,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:05:40,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019664504] [2024-12-02 06:05:40,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:40,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 06:05:40,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:40,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 06:05:40,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 06:05:40,956 INFO L87 Difference]: Start difference. First operand 707 states and 834 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:41,487 INFO L93 Difference]: Finished difference Result 734 states and 888 transitions. [2024-12-02 06:05:41,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 06:05:41,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-12-02 06:05:41,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:41,491 INFO L225 Difference]: With dead ends: 734 [2024-12-02 06:05:41,491 INFO L226 Difference]: Without dead ends: 734 [2024-12-02 06:05:41,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:05:41,492 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 943 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:41,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 735 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 06:05:41,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-12-02 06:05:41,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 684. [2024-12-02 06:05:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 451 states have (on average 1.7849223946784922) internal successors, (805), 679 states have internal predecessors, (805), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:05:41,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 811 transitions. [2024-12-02 06:05:41,511 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 811 transitions. Word has length 16 [2024-12-02 06:05:41,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:41,511 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 811 transitions. [2024-12-02 06:05:41,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:41,512 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 811 transitions. [2024-12-02 06:05:41,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-02 06:05:41,512 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:41,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:41,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 06:05:41,512 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:41,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:41,513 INFO L85 PathProgramCache]: Analyzing trace with hash 247711512, now seen corresponding path program 1 times [2024-12-02 06:05:41,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:41,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058539823] [2024-12-02 06:05:41,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:41,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:41,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058539823] [2024-12-02 06:05:41,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058539823] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:41,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:41,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:05:41,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897759333] [2024-12-02 06:05:41,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:41,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:05:41,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:41,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:05:41,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:05:41,598 INFO L87 Difference]: Start difference. First operand 684 states and 811 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:41,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:41,628 INFO L93 Difference]: Finished difference Result 609 states and 708 transitions. [2024-12-02 06:05:41,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:05:41,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-12-02 06:05:41,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:41,631 INFO L225 Difference]: With dead ends: 609 [2024-12-02 06:05:41,631 INFO L226 Difference]: Without dead ends: 609 [2024-12-02 06:05:41,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:05:41,632 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 61 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:41,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1179 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:05:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-12-02 06:05:41,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-12-02 06:05:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 388 states have (on average 1.809278350515464) internal successors, (702), 604 states have internal predecessors, (702), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:05:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 708 transitions. [2024-12-02 06:05:41,647 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 708 transitions. Word has length 16 [2024-12-02 06:05:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:41,647 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 708 transitions. [2024-12-02 06:05:41,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 708 transitions. [2024-12-02 06:05:41,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-02 06:05:41,648 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:41,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:41,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 06:05:41,648 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:41,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:41,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1827838193, now seen corresponding path program 1 times [2024-12-02 06:05:41,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:41,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451831057] [2024-12-02 06:05:41,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:41,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:41,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:41,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451831057] [2024-12-02 06:05:41,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451831057] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:41,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:41,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 06:05:41,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825838408] [2024-12-02 06:05:41,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:41,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 06:05:41,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:41,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 06:05:41,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 06:05:41,728 INFO L87 Difference]: Start difference. First operand 609 states and 708 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:41,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:41,780 INFO L93 Difference]: Finished difference Result 591 states and 683 transitions. [2024-12-02 06:05:41,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 06:05:41,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-12-02 06:05:41,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:41,782 INFO L225 Difference]: With dead ends: 591 [2024-12-02 06:05:41,783 INFO L226 Difference]: Without dead ends: 591 [2024-12-02 06:05:41,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:05:41,783 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 41 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:41,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1715 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:05:41,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-12-02 06:05:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 588. [2024-12-02 06:05:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 374 states have (on average 1.8021390374331552) internal successors, (674), 583 states have internal predecessors, (674), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:05:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 680 transitions. [2024-12-02 06:05:41,794 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 680 transitions. Word has length 18 [2024-12-02 06:05:41,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:41,795 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 680 transitions. [2024-12-02 06:05:41,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 680 transitions. [2024-12-02 06:05:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-02 06:05:41,795 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:41,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:41,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 06:05:41,796 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:41,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:41,796 INFO L85 PathProgramCache]: Analyzing trace with hash -385577985, now seen corresponding path program 1 times [2024-12-02 06:05:41,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:41,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301674677] [2024-12-02 06:05:41,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:41,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:41,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:41,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301674677] [2024-12-02 06:05:41,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301674677] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:41,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:41,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:05:41,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712794250] [2024-12-02 06:05:41,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:41,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 06:05:41,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:41,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 06:05:41,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 06:05:41,944 INFO L87 Difference]: Start difference. First operand 588 states and 680 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:42,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:42,441 INFO L93 Difference]: Finished difference Result 682 states and 768 transitions. [2024-12-02 06:05:42,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 06:05:42,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-12-02 06:05:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:42,444 INFO L225 Difference]: With dead ends: 682 [2024-12-02 06:05:42,444 INFO L226 Difference]: Without dead ends: 682 [2024-12-02 06:05:42,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:05:42,445 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 418 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:42,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1016 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 06:05:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-12-02 06:05:42,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 584. [2024-12-02 06:05:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 374 states have (on average 1.7914438502673797) internal successors, (670), 579 states have internal predecessors, (670), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:05:42,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 676 transitions. [2024-12-02 06:05:42,456 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 676 transitions. Word has length 32 [2024-12-02 06:05:42,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:42,456 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 676 transitions. [2024-12-02 06:05:42,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:42,457 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 676 transitions. [2024-12-02 06:05:42,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-02 06:05:42,458 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:42,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:42,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 06:05:42,458 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:42,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:42,458 INFO L85 PathProgramCache]: Analyzing trace with hash 945049781, now seen corresponding path program 1 times [2024-12-02 06:05:42,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:42,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705959564] [2024-12-02 06:05:42,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:42,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:42,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:42,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705959564] [2024-12-02 06:05:42,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705959564] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:42,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:42,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 06:05:42,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132812980] [2024-12-02 06:05:42,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:42,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 06:05:42,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:42,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 06:05:42,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 06:05:42,574 INFO L87 Difference]: Start difference. First operand 584 states and 676 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:42,620 INFO L93 Difference]: Finished difference Result 584 states and 672 transitions. [2024-12-02 06:05:42,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:05:42,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-12-02 06:05:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:42,623 INFO L225 Difference]: With dead ends: 584 [2024-12-02 06:05:42,623 INFO L226 Difference]: Without dead ends: 584 [2024-12-02 06:05:42,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:05:42,623 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 21 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:42,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1697 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:05:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-12-02 06:05:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2024-12-02 06:05:42,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 374 states have (on average 1.7807486631016043) internal successors, (666), 579 states have internal predecessors, (666), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:05:42,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 672 transitions. [2024-12-02 06:05:42,634 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 672 transitions. Word has length 66 [2024-12-02 06:05:42,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:42,635 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 672 transitions. [2024-12-02 06:05:42,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 672 transitions. [2024-12-02 06:05:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-02 06:05:42,636 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:42,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:42,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 06:05:42,636 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:42,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:42,637 INFO L85 PathProgramCache]: Analyzing trace with hash -729166719, now seen corresponding path program 1 times [2024-12-02 06:05:42,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:42,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30376221] [2024-12-02 06:05:42,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:42,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:42,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:42,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30376221] [2024-12-02 06:05:42,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30376221] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:42,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:42,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:05:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880270362] [2024-12-02 06:05:42,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:42,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:05:42,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:42,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:05:42,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:05:42,769 INFO L87 Difference]: Start difference. First operand 584 states and 672 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:42,809 INFO L93 Difference]: Finished difference Result 681 states and 796 transitions. [2024-12-02 06:05:42,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:05:42,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-12-02 06:05:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:42,812 INFO L225 Difference]: With dead ends: 681 [2024-12-02 06:05:42,812 INFO L226 Difference]: Without dead ends: 681 [2024-12-02 06:05:42,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:05:42,813 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 54 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:42,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1154 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:05:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-12-02 06:05:42,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2024-12-02 06:05:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 471 states have (on average 1.6772823779193207) internal successors, (790), 676 states have internal predecessors, (790), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:05:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 796 transitions. [2024-12-02 06:05:42,824 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 796 transitions. Word has length 74 [2024-12-02 06:05:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:42,825 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 796 transitions. [2024-12-02 06:05:42,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 796 transitions. [2024-12-02 06:05:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-02 06:05:42,826 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:42,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:42,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 06:05:42,826 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:42,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:42,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1229812623, now seen corresponding path program 1 times [2024-12-02 06:05:42,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:42,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531718520] [2024-12-02 06:05:42,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:42,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:43,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:43,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531718520] [2024-12-02 06:05:43,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531718520] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:43,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:43,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:05:43,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383120592] [2024-12-02 06:05:43,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:43,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 06:05:43,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:43,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 06:05:43,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:05:43,318 INFO L87 Difference]: Start difference. First operand 681 states and 796 transitions. Second operand has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:43,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:43,874 INFO L93 Difference]: Finished difference Result 643 states and 758 transitions. [2024-12-02 06:05:43,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:05:43,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-12-02 06:05:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:43,877 INFO L225 Difference]: With dead ends: 643 [2024-12-02 06:05:43,877 INFO L226 Difference]: Without dead ends: 643 [2024-12-02 06:05:43,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:05:43,878 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 938 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:43,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 473 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 06:05:43,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-12-02 06:05:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 603. [2024-12-02 06:05:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 431 states have (on average 1.5614849187935034) internal successors, (673), 598 states have internal predecessors, (673), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:05:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 679 transitions. [2024-12-02 06:05:43,889 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 679 transitions. Word has length 77 [2024-12-02 06:05:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:43,889 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 679 transitions. [2024-12-02 06:05:43,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 679 transitions. [2024-12-02 06:05:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-02 06:05:43,890 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:43,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:43,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 06:05:43,891 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:43,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:43,891 INFO L85 PathProgramCache]: Analyzing trace with hash -795601644, now seen corresponding path program 1 times [2024-12-02 06:05:43,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:43,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333846342] [2024-12-02 06:05:43,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:43,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:44,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:44,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333846342] [2024-12-02 06:05:44,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333846342] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:44,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:44,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 06:05:44,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496728890] [2024-12-02 06:05:44,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:44,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:05:44,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:44,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:05:44,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:05:44,212 INFO L87 Difference]: Start difference. First operand 603 states and 679 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:44,685 INFO L93 Difference]: Finished difference Result 602 states and 678 transitions. [2024-12-02 06:05:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:05:44,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-12-02 06:05:44,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:44,688 INFO L225 Difference]: With dead ends: 602 [2024-12-02 06:05:44,688 INFO L226 Difference]: Without dead ends: 602 [2024-12-02 06:05:44,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:05:44,689 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 2 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:44,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1510 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 06:05:44,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-12-02 06:05:44,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-12-02 06:05:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 431 states have (on average 1.5591647331786542) internal successors, (672), 597 states have internal predecessors, (672), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:05:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 678 transitions. [2024-12-02 06:05:44,699 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 678 transitions. Word has length 82 [2024-12-02 06:05:44,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:44,700 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 678 transitions. [2024-12-02 06:05:44,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 678 transitions. [2024-12-02 06:05:44,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-02 06:05:44,701 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:44,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:44,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 06:05:44,701 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:44,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:44,701 INFO L85 PathProgramCache]: Analyzing trace with hash -795601643, now seen corresponding path program 1 times [2024-12-02 06:05:44,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:44,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881143138] [2024-12-02 06:05:44,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:44,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:45,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:45,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881143138] [2024-12-02 06:05:45,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881143138] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:45,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:45,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 06:05:45,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486623324] [2024-12-02 06:05:45,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:45,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:05:45,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:45,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:05:45,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:05:45,164 INFO L87 Difference]: Start difference. First operand 602 states and 678 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:45,692 INFO L93 Difference]: Finished difference Result 601 states and 677 transitions. [2024-12-02 06:05:45,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:05:45,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-12-02 06:05:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:45,695 INFO L225 Difference]: With dead ends: 601 [2024-12-02 06:05:45,695 INFO L226 Difference]: Without dead ends: 601 [2024-12-02 06:05:45,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:05:45,696 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 1 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:45,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1519 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 06:05:45,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-12-02 06:05:45,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2024-12-02 06:05:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 430 states have (on average 1.5604651162790697) internal successors, (671), 596 states have internal predecessors, (671), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:05:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 677 transitions. [2024-12-02 06:05:45,706 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 677 transitions. Word has length 82 [2024-12-02 06:05:45,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:45,707 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 677 transitions. [2024-12-02 06:05:45,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:05:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 677 transitions. [2024-12-02 06:05:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-02 06:05:45,708 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:45,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:45,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 06:05:45,708 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:45,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:45,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1932962117, now seen corresponding path program 1 times [2024-12-02 06:05:45,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:45,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457512081] [2024-12-02 06:05:45,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:45,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:45,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:45,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457512081] [2024-12-02 06:05:45,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457512081] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:45,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:45,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 06:05:45,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616466377] [2024-12-02 06:05:45,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:45,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 06:05:45,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:45,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 06:05:45,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 06:05:45,960 INFO L87 Difference]: Start difference. First operand 601 states and 677 transitions. Second operand has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:05:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:46,579 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2024-12-02 06:05:46,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 06:05:46,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-12-02 06:05:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:46,583 INFO L225 Difference]: With dead ends: 613 [2024-12-02 06:05:46,583 INFO L226 Difference]: Without dead ends: 613 [2024-12-02 06:05:46,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-12-02 06:05:46,584 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 6 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:46,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2363 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 06:05:46,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-12-02 06:05:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 607. [2024-12-02 06:05:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 435 states have (on average 1.5586206896551724) internal successors, (678), 601 states have internal predecessors, (678), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-12-02 06:05:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 687 transitions. [2024-12-02 06:05:46,596 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 687 transitions. Word has length 90 [2024-12-02 06:05:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:46,596 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 687 transitions. [2024-12-02 06:05:46,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:05:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 687 transitions. [2024-12-02 06:05:46,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-02 06:05:46,597 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:46,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:46,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 06:05:46,597 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:46,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:46,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1932962116, now seen corresponding path program 1 times [2024-12-02 06:05:46,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:46,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994696281] [2024-12-02 06:05:46,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:46,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:47,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:47,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994696281] [2024-12-02 06:05:47,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994696281] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:47,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:47,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:05:47,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509700497] [2024-12-02 06:05:47,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:47,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 06:05:47,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:47,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 06:05:47,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:05:47,084 INFO L87 Difference]: Start difference. First operand 607 states and 687 transitions. Second operand has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:05:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:47,674 INFO L93 Difference]: Finished difference Result 607 states and 686 transitions. [2024-12-02 06:05:47,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:05:47,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-12-02 06:05:47,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:47,676 INFO L225 Difference]: With dead ends: 607 [2024-12-02 06:05:47,676 INFO L226 Difference]: Without dead ends: 607 [2024-12-02 06:05:47,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 06:05:47,677 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:47,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1955 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 06:05:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-12-02 06:05:47,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2024-12-02 06:05:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 435 states have (on average 1.5563218390804598) internal successors, (677), 601 states have internal predecessors, (677), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-12-02 06:05:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 686 transitions. [2024-12-02 06:05:47,687 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 686 transitions. Word has length 90 [2024-12-02 06:05:47,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:47,688 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 686 transitions. [2024-12-02 06:05:47,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:05:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 686 transitions. [2024-12-02 06:05:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-02 06:05:47,688 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:47,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:47,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 06:05:47,689 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:47,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:47,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1489621638, now seen corresponding path program 1 times [2024-12-02 06:05:47,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:47,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736119482] [2024-12-02 06:05:47,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:47,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:48,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:48,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736119482] [2024-12-02 06:05:48,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736119482] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:05:48,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201989621] [2024-12-02 06:05:48,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:48,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:05:48,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:05:48,156 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:05:48,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 06:05:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:48,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 06:05:48,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:05:48,488 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:05:48,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:05:48,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:05:48,568 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:05:48,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:05:48,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:05:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:48,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:05:48,649 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-12-02 06:05:48,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-12-02 06:05:48,657 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_502) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem51#1.base|)) is different from false [2024-12-02 06:05:48,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201989621] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:05:48,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:05:48,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2024-12-02 06:05:48,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871872092] [2024-12-02 06:05:48,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:05:48,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 06:05:48,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:48,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 06:05:48,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-12-02 06:05:48,660 INFO L87 Difference]: Start difference. First operand 607 states and 686 transitions. Second operand has 14 states, 12 states have (on average 8.666666666666666) internal successors, (104), 13 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 06:05:49,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:49,972 INFO L93 Difference]: Finished difference Result 606 states and 685 transitions. [2024-12-02 06:05:49,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 06:05:49,973 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.666666666666666) internal successors, (104), 13 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2024-12-02 06:05:49,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:49,976 INFO L225 Difference]: With dead ends: 606 [2024-12-02 06:05:49,976 INFO L226 Difference]: Without dead ends: 606 [2024-12-02 06:05:49,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2024-12-02 06:05:49,977 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 502 mSDsluCounter, 2494 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 2821 SdHoareTripleChecker+Invalid, 2137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:49,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 2821 Invalid, 2137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-12-02 06:05:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-12-02 06:05:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-12-02 06:05:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 435 states have (on average 1.554022988505747) internal successors, (676), 600 states have internal predecessors, (676), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-12-02 06:05:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 685 transitions. [2024-12-02 06:05:49,988 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 685 transitions. Word has length 91 [2024-12-02 06:05:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:49,988 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 685 transitions. [2024-12-02 06:05:49,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.666666666666666) internal successors, (104), 13 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 06:05:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 685 transitions. [2024-12-02 06:05:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-02 06:05:49,989 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:49,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:49,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 06:05:50,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-12-02 06:05:50,190 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:50,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:50,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1489621639, now seen corresponding path program 1 times [2024-12-02 06:05:50,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:50,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682508591] [2024-12-02 06:05:50,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:50,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:50,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:50,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682508591] [2024-12-02 06:05:50,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682508591] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:05:50,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741978422] [2024-12-02 06:05:50,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:50,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:05:50,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:05:50,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:05:50,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 06:05:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:50,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-12-02 06:05:50,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:05:50,964 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:05:50,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:05:50,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 06:05:50,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-12-02 06:05:50,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:05:51,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-12-02 06:05:51,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:05:51,165 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:05:51,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-02 06:05:51,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:05:51,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:05:51,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:05:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:51,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:05:51,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_629 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-12-02 06:05:51,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741978422] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:05:51,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:05:51,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2024-12-02 06:05:51,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757107075] [2024-12-02 06:05:51,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:05:51,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-02 06:05:51,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:51,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-02 06:05:51,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2024-12-02 06:05:51,303 INFO L87 Difference]: Start difference. First operand 606 states and 685 transitions. Second operand has 15 states, 12 states have (on average 9.166666666666666) internal successors, (110), 15 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:05:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:52,603 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2024-12-02 06:05:52,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 06:05:52,603 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.166666666666666) internal successors, (110), 15 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2024-12-02 06:05:52,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:52,605 INFO L225 Difference]: With dead ends: 613 [2024-12-02 06:05:52,605 INFO L226 Difference]: Without dead ends: 613 [2024-12-02 06:05:52,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2024-12-02 06:05:52,605 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 495 mSDsluCounter, 1889 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:52,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 2218 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2178 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-12-02 06:05:52,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-12-02 06:05:52,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 604. [2024-12-02 06:05:52,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 434 states have (on average 1.5529953917050692) internal successors, (674), 598 states have internal predecessors, (674), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:05:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 680 transitions. [2024-12-02 06:05:52,613 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 680 transitions. Word has length 91 [2024-12-02 06:05:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:52,613 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 680 transitions. [2024-12-02 06:05:52,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.166666666666666) internal successors, (110), 15 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:05:52,613 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 680 transitions. [2024-12-02 06:05:52,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-02 06:05:52,614 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:52,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:52,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 06:05:52,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-12-02 06:05:52,814 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:52,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:52,815 INFO L85 PathProgramCache]: Analyzing trace with hash 2047694902, now seen corresponding path program 1 times [2024-12-02 06:05:52,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:52,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542730359] [2024-12-02 06:05:52,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:52,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:53,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:53,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542730359] [2024-12-02 06:05:53,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542730359] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:53,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:53,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-12-02 06:05:53,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269609307] [2024-12-02 06:05:53,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:53,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 06:05:53,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:53,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 06:05:53,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-12-02 06:05:53,165 INFO L87 Difference]: Start difference. First operand 604 states and 680 transitions. Second operand has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:05:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:54,058 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-12-02 06:05:54,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 06:05:54,058 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-12-02 06:05:54,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:54,060 INFO L225 Difference]: With dead ends: 617 [2024-12-02 06:05:54,060 INFO L226 Difference]: Without dead ends: 617 [2024-12-02 06:05:54,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-12-02 06:05:54,060 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 502 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:54,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 2507 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1914 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 06:05:54,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-12-02 06:05:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2024-12-02 06:05:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 442 states have (on average 1.5475113122171946) internal successors, (684), 606 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:05:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 691 transitions. [2024-12-02 06:05:54,070 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 691 transitions. Word has length 93 [2024-12-02 06:05:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:54,071 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 691 transitions. [2024-12-02 06:05:54,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:05:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 691 transitions. [2024-12-02 06:05:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-02 06:05:54,072 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:54,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:54,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 06:05:54,072 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:54,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:54,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2047694903, now seen corresponding path program 1 times [2024-12-02 06:05:54,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:54,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673787992] [2024-12-02 06:05:54,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:54,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:54,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:54,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673787992] [2024-12-02 06:05:54,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673787992] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:05:54,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:05:54,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 06:05:54,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376147860] [2024-12-02 06:05:54,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:05:54,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 06:05:54,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:54,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 06:05:54,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-12-02 06:05:54,576 INFO L87 Difference]: Start difference. First operand 613 states and 691 transitions. Second operand has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:05:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:55,643 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-12-02 06:05:55,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 06:05:55,644 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-12-02 06:05:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:55,646 INFO L225 Difference]: With dead ends: 616 [2024-12-02 06:05:55,646 INFO L226 Difference]: Without dead ends: 616 [2024-12-02 06:05:55,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-12-02 06:05:55,646 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 479 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1895 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:55,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1895 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 06:05:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-12-02 06:05:55,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2024-12-02 06:05:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 442 states have (on average 1.5452488687782806) internal successors, (683), 606 states have internal predecessors, (683), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:05:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 690 transitions. [2024-12-02 06:05:55,653 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 690 transitions. Word has length 93 [2024-12-02 06:05:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:55,653 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 690 transitions. [2024-12-02 06:05:55,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:05:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 690 transitions. [2024-12-02 06:05:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-02 06:05:55,654 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:55,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:55,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 06:05:55,654 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:55,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:55,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1716733067, now seen corresponding path program 1 times [2024-12-02 06:05:55,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:55,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481497362] [2024-12-02 06:05:55,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:55,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:56,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:56,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481497362] [2024-12-02 06:05:56,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481497362] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:05:56,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232366654] [2024-12-02 06:05:56,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:56,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:05:56,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:05:56,076 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:05:56,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 06:05:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:56,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-12-02 06:05:56,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:05:56,360 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:05:56,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:05:56,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:05:56,418 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:05:56,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:05:56,463 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:05:56,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:05:56,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:05:56,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:56,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:05:56,490 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_878) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-12-02 06:05:56,550 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-12-02 06:05:56,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-12-02 06:05:56,555 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_881 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_881))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_878)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-12-02 06:05:56,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232366654] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:05:56,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:05:56,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2024-12-02 06:05:56,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995242332] [2024-12-02 06:05:56,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:05:56,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 06:05:56,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:56,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 06:05:56,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=225, Unknown=6, NotChecked=62, Total=342 [2024-12-02 06:05:56,558 INFO L87 Difference]: Start difference. First operand 613 states and 690 transitions. Second operand has 16 states, 14 states have (on average 7.785714285714286) internal successors, (109), 15 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:05:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:05:57,598 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-12-02 06:05:57,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 06:05:57,599 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.785714285714286) internal successors, (109), 15 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-12-02 06:05:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:05:57,600 INFO L225 Difference]: With dead ends: 615 [2024-12-02 06:05:57,601 INFO L226 Difference]: Without dead ends: 615 [2024-12-02 06:05:57,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=451, Unknown=6, NotChecked=90, Total=650 [2024-12-02 06:05:57,601 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 496 mSDsluCounter, 3065 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 3391 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 06:05:57,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 3391 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 06:05:57,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-12-02 06:05:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 612. [2024-12-02 06:05:57,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 442 states have (on average 1.5429864253393666) internal successors, (682), 605 states have internal predecessors, (682), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:05:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 689 transitions. [2024-12-02 06:05:57,611 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 689 transitions. Word has length 94 [2024-12-02 06:05:57,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:05:57,611 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 689 transitions. [2024-12-02 06:05:57,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.785714285714286) internal successors, (109), 15 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:05:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 689 transitions. [2024-12-02 06:05:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-02 06:05:57,612 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:05:57,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:05:57,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 06:05:57,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:05:57,813 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:05:57,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:05:57,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1716733068, now seen corresponding path program 1 times [2024-12-02 06:05:57,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:05:57,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868267252] [2024-12-02 06:05:57,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:57,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:05:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:58,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:58,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:05:58,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868267252] [2024-12-02 06:05:58,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868267252] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:05:58,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360770578] [2024-12-02 06:05:58,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:05:58,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:05:58,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:05:58,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:05:58,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 06:05:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:05:58,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-12-02 06:05:58,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:05:58,700 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:05:58,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:05:58,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:05:58,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-12-02 06:05:58,896 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:05:58,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-02 06:05:58,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:05:58,972 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:05:58,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-02 06:05:58,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:05:59,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:05:59,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:05:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:05:59,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:05:59,076 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1016 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1015 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-12-02 06:05:59,087 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1015 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1016) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1016 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1016) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-12-02 06:05:59,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:05:59,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 88 [2024-12-02 06:05:59,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360770578] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:05:59,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:05:59,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2024-12-02 06:05:59,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185818647] [2024-12-02 06:05:59,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:05:59,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-12-02 06:05:59,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:05:59,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-12-02 06:05:59,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=478, Unknown=2, NotChecked=90, Total=650 [2024-12-02 06:05:59,266 INFO L87 Difference]: Start difference. First operand 612 states and 689 transitions. Second operand has 21 states, 18 states have (on average 6.777777777777778) internal successors, (122), 21 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:06:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:06:00,882 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2024-12-02 06:06:00,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 06:06:00,882 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.777777777777778) internal successors, (122), 21 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2024-12-02 06:06:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:06:00,883 INFO L225 Difference]: With dead ends: 614 [2024-12-02 06:06:00,883 INFO L226 Difference]: Without dead ends: 614 [2024-12-02 06:06:00,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=690, Unknown=2, NotChecked=110, Total=930 [2024-12-02 06:06:00,884 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 474 mSDsluCounter, 3248 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 3572 SdHoareTripleChecker+Invalid, 3547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-12-02 06:06:00,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 3572 Invalid, 3547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3528 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-12-02 06:06:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-12-02 06:06:00,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 602. [2024-12-02 06:06:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 434 states have (on average 1.5483870967741935) internal successors, (672), 596 states have internal predecessors, (672), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:06:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 678 transitions. [2024-12-02 06:06:00,891 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 678 transitions. Word has length 94 [2024-12-02 06:06:00,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:06:00,891 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 678 transitions. [2024-12-02 06:06:00,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.777777777777778) internal successors, (122), 21 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:06:00,891 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 678 transitions. [2024-12-02 06:06:00,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-02 06:06:00,892 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:06:00,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:06:00,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 06:06:01,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-12-02 06:06:01,092 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:06:01,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:06:01,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1458945026, now seen corresponding path program 1 times [2024-12-02 06:06:01,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:06:01,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195508073] [2024-12-02 06:06:01,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:01,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:06:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:01,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:06:01,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195508073] [2024-12-02 06:06:01,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195508073] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:06:01,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:06:01,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-12-02 06:06:01,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342447416] [2024-12-02 06:06:01,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:06:01,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-02 06:06:01,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:06:01,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-02 06:06:01,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-12-02 06:06:01,510 INFO L87 Difference]: Start difference. First operand 602 states and 678 transitions. Second operand has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:06:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:06:02,462 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-12-02 06:06:02,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 06:06:02,462 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-12-02 06:06:02,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:06:02,464 INFO L225 Difference]: With dead ends: 618 [2024-12-02 06:06:02,464 INFO L226 Difference]: Without dead ends: 618 [2024-12-02 06:06:02,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-12-02 06:06:02,465 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 503 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 06:06:02,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 2502 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 06:06:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-12-02 06:06:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 614. [2024-12-02 06:06:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 445 states have (on average 1.5393258426966292) internal successors, (685), 607 states have internal predecessors, (685), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:06:02,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 692 transitions. [2024-12-02 06:06:02,471 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 692 transitions. Word has length 96 [2024-12-02 06:06:02,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:06:02,471 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 692 transitions. [2024-12-02 06:06:02,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:06:02,471 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 692 transitions. [2024-12-02 06:06:02,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-02 06:06:02,472 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:06:02,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:06:02,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 06:06:02,472 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:06:02,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:06:02,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1458945027, now seen corresponding path program 1 times [2024-12-02 06:06:02,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:06:02,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064819230] [2024-12-02 06:06:02,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:02,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:06:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:02,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:06:02,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064819230] [2024-12-02 06:06:02,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064819230] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:06:02,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:06:02,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-12-02 06:06:02,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979988572] [2024-12-02 06:06:02,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:06:02,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 06:06:02,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:06:02,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 06:06:02,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-12-02 06:06:02,949 INFO L87 Difference]: Start difference. First operand 614 states and 692 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:06:04,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:06:04,011 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-12-02 06:06:04,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 06:06:04,011 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-12-02 06:06:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:06:04,013 INFO L225 Difference]: With dead ends: 617 [2024-12-02 06:06:04,013 INFO L226 Difference]: Without dead ends: 617 [2024-12-02 06:06:04,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-12-02 06:06:04,013 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 497 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:06:04,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 2129 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 06:06:04,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-12-02 06:06:04,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2024-12-02 06:06:04,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 445 states have (on average 1.5370786516853931) internal successors, (684), 607 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:06:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2024-12-02 06:06:04,018 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 96 [2024-12-02 06:06:04,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:06:04,018 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2024-12-02 06:06:04,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:06:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2024-12-02 06:06:04,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-02 06:06:04,019 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:06:04,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:06:04,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 06:06:04,019 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:06:04,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:06:04,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1275137139, now seen corresponding path program 1 times [2024-12-02 06:06:04,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:06:04,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170628177] [2024-12-02 06:06:04,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:04,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:06:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:04,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:06:04,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170628177] [2024-12-02 06:06:04,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170628177] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:06:04,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907678470] [2024-12-02 06:06:04,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:04,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:06:04,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:06:04,398 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:06:04,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 06:06:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:04,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-12-02 06:06:04,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:06:04,627 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:06:04,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:06:04,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:06:04,674 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:04,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:06:04,716 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:04,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:06:04,755 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:04,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:06:04,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:06:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:04,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:06:04,826 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1294))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1295)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 06:06:04,831 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1294))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1295)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 06:06:04,858 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-12-02 06:06:04,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-12-02 06:06:04,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907678470] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:06:04,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:06:04,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2024-12-02 06:06:04,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301586110] [2024-12-02 06:06:04,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:06:04,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-12-02 06:06:04,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:06:04,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-12-02 06:06:04,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=337, Unknown=22, NotChecked=78, Total=506 [2024-12-02 06:06:04,896 INFO L87 Difference]: Start difference. First operand 614 states and 691 transitions. Second operand has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:06:06,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:06:06,077 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-12-02 06:06:06,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 06:06:06,078 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2024-12-02 06:06:06,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:06:06,080 INFO L225 Difference]: With dead ends: 616 [2024-12-02 06:06:06,080 INFO L226 Difference]: Without dead ends: 616 [2024-12-02 06:06:06,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=661, Unknown=22, NotChecked=110, Total=930 [2024-12-02 06:06:06,081 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 474 mSDsluCounter, 3069 mSDsCounter, 0 mSdLazyCounter, 2594 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 3394 SdHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:06:06,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 3394 Invalid, 2608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2594 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 06:06:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-12-02 06:06:06,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2024-12-02 06:06:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 445 states have (on average 1.5348314606741573) internal successors, (683), 606 states have internal predecessors, (683), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:06:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 690 transitions. [2024-12-02 06:06:06,085 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 690 transitions. Word has length 97 [2024-12-02 06:06:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:06:06,086 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 690 transitions. [2024-12-02 06:06:06,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:06:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 690 transitions. [2024-12-02 06:06:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-02 06:06:06,086 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:06:06,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:06:06,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 06:06:06,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-12-02 06:06:06,287 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:06:06,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:06:06,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1275137138, now seen corresponding path program 1 times [2024-12-02 06:06:06,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:06:06,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970631309] [2024-12-02 06:06:06,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:06:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:06,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:06,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:06:06,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970631309] [2024-12-02 06:06:06,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970631309] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:06:06,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131806908] [2024-12-02 06:06:06,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:06,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:06:06,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:06:06,890 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:06:06,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 06:06:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:07,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-12-02 06:06:07,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:06:07,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 06:06:07,137 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:06:07,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:06:07,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-12-02 06:06:07,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:06:07,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-12-02 06:06:07,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:06:07,321 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:07,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-02 06:06:07,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:06:07,388 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:07,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-02 06:06:07,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:06:07,445 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:07,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-02 06:06:07,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:06:07,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:06:07,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:06:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:07,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:06:07,540 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1447 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1448 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2024-12-02 06:06:07,549 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1447 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1448 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-12-02 06:06:07,565 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1445))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1446) .cse0 v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1446) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-12-02 06:06:07,577 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1446) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1445))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1446) .cse2 v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-12-02 06:06:07,626 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1454))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1453) .cse0 v_ArrVal_1446) (select (select (store .cse1 .cse0 v_ArrVal_1445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1448))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1454))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1445))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1453) .cse3 v_ArrVal_1446) .cse4 v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-12-02 06:06:07,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131806908] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:06:07,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:06:07,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2024-12-02 06:06:07,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267376005] [2024-12-02 06:06:07,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:06:07,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-12-02 06:06:07,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:06:07,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-12-02 06:06:07,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=479, Unknown=5, NotChecked=240, Total=812 [2024-12-02 06:06:07,629 INFO L87 Difference]: Start difference. First operand 613 states and 690 transitions. Second operand has 22 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:06:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:06:09,099 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-12-02 06:06:09,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 06:06:09,099 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-12-02 06:06:09,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:06:09,101 INFO L225 Difference]: With dead ends: 615 [2024-12-02 06:06:09,101 INFO L226 Difference]: Without dead ends: 615 [2024-12-02 06:06:09,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=744, Unknown=5, NotChecked=300, Total=1190 [2024-12-02 06:06:09,102 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 493 mSDsluCounter, 2601 mSDsCounter, 0 mSdLazyCounter, 3116 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 2928 SdHoareTripleChecker+Invalid, 3135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-12-02 06:06:09,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 2928 Invalid, 3135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3116 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-12-02 06:06:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-12-02 06:06:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 600. [2024-12-02 06:06:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 434 states have (on average 1.543778801843318) internal successors, (670), 594 states have internal predecessors, (670), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:06:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 676 transitions. [2024-12-02 06:06:09,106 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 676 transitions. Word has length 97 [2024-12-02 06:06:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:06:09,106 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 676 transitions. [2024-12-02 06:06:09,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:06:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 676 transitions. [2024-12-02 06:06:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-02 06:06:09,107 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:06:09,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:06:09,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 06:06:09,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:06:09,308 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:06:09,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:06:09,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1637134370, now seen corresponding path program 1 times [2024-12-02 06:06:09,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:06:09,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952803513] [2024-12-02 06:06:09,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:09,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:06:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:09,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:06:09,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952803513] [2024-12-02 06:06:09,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952803513] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:06:09,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:06:09,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 06:06:09,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218459598] [2024-12-02 06:06:09,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:06:09,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 06:06:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:06:09,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 06:06:09,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-12-02 06:06:09,896 INFO L87 Difference]: Start difference. First operand 600 states and 676 transitions. Second operand has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:06:11,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:06:11,304 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-12-02 06:06:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 06:06:11,305 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-12-02 06:06:11,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:06:11,306 INFO L225 Difference]: With dead ends: 619 [2024-12-02 06:06:11,306 INFO L226 Difference]: Without dead ends: 619 [2024-12-02 06:06:11,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-12-02 06:06:11,307 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 482 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 2806 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-12-02 06:06:11,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 2643 Invalid, 2818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2806 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-12-02 06:06:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-12-02 06:06:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2024-12-02 06:06:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 448 states have (on average 1.53125) internal successors, (686), 608 states have internal predecessors, (686), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:06:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 693 transitions. [2024-12-02 06:06:11,311 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 693 transitions. Word has length 99 [2024-12-02 06:06:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:06:11,311 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 693 transitions. [2024-12-02 06:06:11,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:06:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 693 transitions. [2024-12-02 06:06:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-02 06:06:11,312 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:06:11,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:06:11,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 06:06:11,312 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:06:11,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:06:11,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1637134371, now seen corresponding path program 1 times [2024-12-02 06:06:11,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:06:11,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574724061] [2024-12-02 06:06:11,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:11,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:06:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:11,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:11,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:06:11,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574724061] [2024-12-02 06:06:11,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574724061] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:06:11,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:06:11,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-12-02 06:06:11,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575303332] [2024-12-02 06:06:11,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:06:11,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 06:06:11,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:06:11,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 06:06:11,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-12-02 06:06:11,712 INFO L87 Difference]: Start difference. First operand 615 states and 693 transitions. Second operand has 16 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:06:12,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:06:12,746 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-12-02 06:06:12,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 06:06:12,746 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-12-02 06:06:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:06:12,748 INFO L225 Difference]: With dead ends: 618 [2024-12-02 06:06:12,748 INFO L226 Difference]: Without dead ends: 618 [2024-12-02 06:06:12,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-12-02 06:06:12,748 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 484 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 2384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 06:06:12,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 3115 Invalid, 2384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 06:06:12,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-12-02 06:06:12,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2024-12-02 06:06:12,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 448 states have (on average 1.5290178571428572) internal successors, (685), 608 states have internal predecessors, (685), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:06:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 692 transitions. [2024-12-02 06:06:12,760 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 692 transitions. Word has length 99 [2024-12-02 06:06:12,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:06:12,760 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 692 transitions. [2024-12-02 06:06:12,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:06:12,760 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 692 transitions. [2024-12-02 06:06:12,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-02 06:06:12,760 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:06:12,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:06:12,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 06:06:12,761 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:06:12,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:06:12,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1375856755, now seen corresponding path program 1 times [2024-12-02 06:06:12,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:06:12,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790161962] [2024-12-02 06:06:12,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:12,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:06:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:13,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:06:13,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790161962] [2024-12-02 06:06:13,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790161962] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:06:13,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815940662] [2024-12-02 06:06:13,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:13,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:06:13,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:06:13,538 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:06:13,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 06:06:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:13,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-12-02 06:06:13,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:06:13,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 06:06:13,800 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:06:13,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:06:13,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-12-02 06:06:13,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:06:13,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-12-02 06:06:13,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:06:13,937 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:13,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-02 06:06:13,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:06:14,006 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:14,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-02 06:06:14,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:06:14,070 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:14,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-02 06:06:14,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:06:14,143 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:14,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-02 06:06:14,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:06:14,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:06:14,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:06:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:14,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:06:14,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1757 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2024-12-02 06:06:14,236 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1757 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-12-02 06:06:14,255 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1756))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1755) .cse0 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1755) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-12-02 06:06:14,338 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1753))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1756))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1754) .cse0 v_ArrVal_1755) .cse1 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1753))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1754) .cse5 v_ArrVal_1755) (select (select (store .cse6 .cse5 v_ArrVal_1756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1757))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-12-02 06:06:14,358 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1753))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1756))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1754) .cse1 v_ArrVal_1755) .cse2 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1753))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1754) .cse6 v_ArrVal_1755) (select (select (store .cse7 .cse6 v_ArrVal_1756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1757))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2024-12-02 06:06:14,461 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1764))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1753))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1763) .cse0 v_ArrVal_1754) .cse1 v_ArrVal_1755) (select (select (store .cse2 .cse1 v_ArrVal_1756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1757))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1764))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1753))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1756))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1763) .cse5 v_ArrVal_1754) .cse6 v_ArrVal_1755) .cse7 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-12-02 06:06:14,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815940662] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:06:14,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:06:14,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 19 [2024-12-02 06:06:14,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761090291] [2024-12-02 06:06:14,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:06:14,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-12-02 06:06:14,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:06:14,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-12-02 06:06:14,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=421, Unknown=13, NotChecked=282, Total=812 [2024-12-02 06:06:14,465 INFO L87 Difference]: Start difference. First operand 615 states and 692 transitions. Second operand has 20 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 06:06:16,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:06:16,007 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-12-02 06:06:16,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 06:06:16,007 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-12-02 06:06:16,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:06:16,008 INFO L225 Difference]: With dead ends: 617 [2024-12-02 06:06:16,008 INFO L226 Difference]: Without dead ends: 617 [2024-12-02 06:06:16,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=725, Unknown=13, NotChecked=366, Total=1260 [2024-12-02 06:06:16,009 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 472 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:06:16,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 2450 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-12-02 06:06:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-12-02 06:06:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2024-12-02 06:06:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 448 states have (on average 1.5267857142857142) internal successors, (684), 607 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:06:16,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2024-12-02 06:06:16,013 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 100 [2024-12-02 06:06:16,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:06:16,014 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2024-12-02 06:06:16,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 06:06:16,014 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2024-12-02 06:06:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-02 06:06:16,014 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:06:16,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:06:16,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 06:06:16,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:06:16,215 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:06:16,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:06:16,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1375856754, now seen corresponding path program 1 times [2024-12-02 06:06:16,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:06:16,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368034829] [2024-12-02 06:06:16,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:16,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:06:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:16,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:06:16,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368034829] [2024-12-02 06:06:16,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368034829] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:06:16,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851720407] [2024-12-02 06:06:16,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:16,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:06:16,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:06:16,654 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:06:16,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 06:06:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:16,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-12-02 06:06:16,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:06:16,929 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:06:16,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:06:16,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:06:16,973 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:16,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:06:17,014 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:17,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:06:17,056 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:17,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:06:17,100 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:17,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:06:17,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:06:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:17,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:06:17,122 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1922) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-12-02 06:06:17,152 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1921))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 06:06:17,156 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1921))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 06:06:17,164 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1920 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1920))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1921)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 06:06:17,228 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-12-02 06:06:17,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-12-02 06:06:17,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851720407] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:06:17,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:06:17,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 19 [2024-12-02 06:06:17,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411136942] [2024-12-02 06:06:17,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:06:17,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-12-02 06:06:17,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:06:17,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-12-02 06:06:17,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=407, Unknown=25, NotChecked=180, Total=702 [2024-12-02 06:06:17,274 INFO L87 Difference]: Start difference. First operand 614 states and 691 transitions. Second operand has 20 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:06:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:06:18,436 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-12-02 06:06:18,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 06:06:18,437 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2024-12-02 06:06:18,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:06:18,438 INFO L225 Difference]: With dead ends: 616 [2024-12-02 06:06:18,438 INFO L226 Difference]: Without dead ends: 616 [2024-12-02 06:06:18,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=809, Unknown=25, NotChecked=252, Total=1260 [2024-12-02 06:06:18,439 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 485 mSDsluCounter, 2789 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 3113 SdHoareTripleChecker+Invalid, 2358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:06:18,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 3113 Invalid, 2358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 06:06:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-12-02 06:06:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 598. [2024-12-02 06:06:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 434 states have (on average 1.5391705069124424) internal successors, (668), 592 states have internal predecessors, (668), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:06:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 674 transitions. [2024-12-02 06:06:18,446 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 674 transitions. Word has length 100 [2024-12-02 06:06:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:06:18,446 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 674 transitions. [2024-12-02 06:06:18,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:06:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 674 transitions. [2024-12-02 06:06:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-02 06:06:18,446 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:06:18,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:06:18,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 06:06:18,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-12-02 06:06:18,647 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:06:18,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:06:18,647 INFO L85 PathProgramCache]: Analyzing trace with hash -679205281, now seen corresponding path program 1 times [2024-12-02 06:06:18,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:06:18,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548719178] [2024-12-02 06:06:18,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:18,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:06:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:19,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:06:19,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548719178] [2024-12-02 06:06:19,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548719178] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:06:19,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:06:19,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-12-02 06:06:19,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712787707] [2024-12-02 06:06:19,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:06:19,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 06:06:19,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:06:19,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 06:06:19,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-12-02 06:06:19,232 INFO L87 Difference]: Start difference. First operand 598 states and 674 transitions. Second operand has 17 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:06:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:06:20,248 INFO L93 Difference]: Finished difference Result 621 states and 700 transitions. [2024-12-02 06:06:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 06:06:20,248 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-12-02 06:06:20,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:06:20,250 INFO L225 Difference]: With dead ends: 621 [2024-12-02 06:06:20,250 INFO L226 Difference]: Without dead ends: 621 [2024-12-02 06:06:20,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2024-12-02 06:06:20,251 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 503 mSDsluCounter, 2486 mSDsCounter, 0 mSdLazyCounter, 2153 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 06:06:20,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 2809 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2153 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 06:06:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-12-02 06:06:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 617. [2024-12-02 06:06:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 452 states have (on average 1.5221238938053097) internal successors, (688), 610 states have internal predecessors, (688), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:06:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 695 transitions. [2024-12-02 06:06:20,255 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 695 transitions. Word has length 103 [2024-12-02 06:06:20,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:06:20,256 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 695 transitions. [2024-12-02 06:06:20,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:06:20,256 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 695 transitions. [2024-12-02 06:06:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-02 06:06:20,256 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:06:20,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:06:20,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 06:06:20,256 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:06:20,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:06:20,257 INFO L85 PathProgramCache]: Analyzing trace with hash -679205280, now seen corresponding path program 1 times [2024-12-02 06:06:20,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:06:20,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886768722] [2024-12-02 06:06:20,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:20,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:06:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:21,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:06:21,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886768722] [2024-12-02 06:06:21,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886768722] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:06:21,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:06:21,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-12-02 06:06:21,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644246133] [2024-12-02 06:06:21,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:06:21,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-12-02 06:06:21,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:06:21,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-12-02 06:06:21,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-12-02 06:06:21,084 INFO L87 Difference]: Start difference. First operand 617 states and 695 transitions. Second operand has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:06:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:06:22,637 INFO L93 Difference]: Finished difference Result 620 states and 699 transitions. [2024-12-02 06:06:22,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 06:06:22,637 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-12-02 06:06:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:06:22,638 INFO L225 Difference]: With dead ends: 620 [2024-12-02 06:06:22,638 INFO L226 Difference]: Without dead ends: 620 [2024-12-02 06:06:22,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-12-02 06:06:22,639 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 481 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 2859 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 2875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:06:22,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 2640 Invalid, 2875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2859 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-12-02 06:06:22,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-12-02 06:06:22,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 617. [2024-12-02 06:06:22,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 452 states have (on average 1.5199115044247788) internal successors, (687), 610 states have internal predecessors, (687), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:06:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 694 transitions. [2024-12-02 06:06:22,644 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 694 transitions. Word has length 103 [2024-12-02 06:06:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:06:22,644 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 694 transitions. [2024-12-02 06:06:22,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:06:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 694 transitions. [2024-12-02 06:06:22,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 06:06:22,645 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:06:22,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:06:22,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-02 06:06:22,645 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:06:22,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:06:22,646 INFO L85 PathProgramCache]: Analyzing trace with hash 910322804, now seen corresponding path program 1 times [2024-12-02 06:06:22,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:06:22,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047561285] [2024-12-02 06:06:22,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:22,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:06:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:23,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:06:23,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047561285] [2024-12-02 06:06:23,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047561285] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:06:23,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393084102] [2024-12-02 06:06:23,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:23,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:06:23,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:06:23,226 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:06:23,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 06:06:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:23,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-02 06:06:23,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:06:23,507 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:06:23,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:06:23,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:06:23,583 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:23,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:06:23,624 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:23,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:06:23,665 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:23,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:06:23,706 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:23,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:06:23,746 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:23,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:06:23,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:06:23,772 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 06:06:23,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 06:06:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:23,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:06:24,370 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-12-02 06:06:24,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-12-02 06:06:24,383 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2260))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2253)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2254)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2255)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2256)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-12-02 06:06:24,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393084102] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:06:24,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:06:24,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 23 [2024-12-02 06:06:24,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447251805] [2024-12-02 06:06:24,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:06:24,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-12-02 06:06:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:06:24,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-12-02 06:06:24,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=915, Unknown=48, NotChecked=64, Total=1190 [2024-12-02 06:06:24,386 INFO L87 Difference]: Start difference. First operand 617 states and 694 transitions. Second operand has 24 states, 21 states have (on average 6.238095238095238) internal successors, (131), 23 states have internal predecessors, (131), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:06:25,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:06:25,937 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-12-02 06:06:25,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 06:06:25,938 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.238095238095238) internal successors, (131), 23 states have internal predecessors, (131), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2024-12-02 06:06:25,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:06:25,939 INFO L225 Difference]: With dead ends: 619 [2024-12-02 06:06:25,939 INFO L226 Difference]: Without dead ends: 619 [2024-12-02 06:06:25,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=267, Invalid=1411, Unknown=48, NotChecked=80, Total=1806 [2024-12-02 06:06:25,940 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 468 mSDsluCounter, 3679 mSDsCounter, 0 mSdLazyCounter, 3092 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:06:25,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 4001 Invalid, 3111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3092 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-12-02 06:06:25,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-12-02 06:06:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 616. [2024-12-02 06:06:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 452 states have (on average 1.5176991150442478) internal successors, (686), 609 states have internal predecessors, (686), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:06:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 693 transitions. [2024-12-02 06:06:25,946 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 693 transitions. Word has length 104 [2024-12-02 06:06:25,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:06:25,947 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 693 transitions. [2024-12-02 06:06:25,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.238095238095238) internal successors, (131), 23 states have internal predecessors, (131), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:06:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 693 transitions. [2024-12-02 06:06:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 06:06:25,947 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:06:25,947 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:06:25,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 06:06:26,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:06:26,148 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:06:26,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:06:26,148 INFO L85 PathProgramCache]: Analyzing trace with hash 910322805, now seen corresponding path program 1 times [2024-12-02 06:06:26,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:06:26,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291742205] [2024-12-02 06:06:26,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:26,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:06:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:27,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:06:27,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291742205] [2024-12-02 06:06:27,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291742205] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:06:27,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596464844] [2024-12-02 06:06:27,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:06:27,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:06:27,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:06:27,114 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:06:27,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 06:06:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:06:27,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-12-02 06:06:27,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:06:27,419 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:06:27,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:06:27,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 06:06:27,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:06:27,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-12-02 06:06:27,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-12-02 06:06:27,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:06:27,644 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:27,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-12-02 06:06:27,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:06:27,753 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:27,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-12-02 06:06:27,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:06:27,838 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:27,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-12-02 06:06:27,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:06:27,927 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:27,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-12-02 06:06:27,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:06:28,000 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:06:28,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-12-02 06:06:28,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:06:28,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-12-02 06:06:28,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:06:28,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:06:28,072 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-12-02 06:06:28,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-12-02 06:06:28,082 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:06:28,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:06:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:06:28,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:06:44,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:06:44,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-12-02 06:06:44,576 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_21 Int)) (or (= |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_21) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_2443 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_ArrVal_2442 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_22))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_prenex_25))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_prenex_23))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_prenex_27))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_19) .cse0 v_prenex_24) .cse1 v_prenex_20) .cse2 v_prenex_18) .cse3 v_prenex_26) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| v_prenex_21 v_ArrVal_2443) (select (select (store .cse5 .cse3 v_ArrVal_2442) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2441 (Array Int Int)) (v_ArrVal_2440 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2448))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_2435))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2437))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2449) .cse9 v_ArrVal_2436) .cse10 v_ArrVal_2438) .cse11 v_ArrVal_2439) (select (select (store .cse12 .cse11 v_ArrVal_2440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2441))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2024-12-02 06:06:44,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596464844] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:06:44,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:06:44,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2024-12-02 06:06:44,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281584871] [2024-12-02 06:06:44,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:06:44,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-12-02 06:06:44,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:06:44,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-12-02 06:06:44,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1653, Unknown=53, NotChecked=84, Total=1980 [2024-12-02 06:06:44,585 INFO L87 Difference]: Start difference. First operand 616 states and 693 transitions. Second operand has 33 states, 30 states have (on average 6.7) internal successors, (201), 32 states have internal predecessors, (201), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:07:08,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:07:08,982 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-12-02 06:07:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-12-02 06:07:08,983 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 6.7) internal successors, (201), 32 states have internal predecessors, (201), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2024-12-02 06:07:08,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:07:08,985 INFO L225 Difference]: With dead ends: 618 [2024-12-02 06:07:08,985 INFO L226 Difference]: Without dead ends: 618 [2024-12-02 06:07:08,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=346, Invalid=2467, Unknown=53, NotChecked=104, Total=2970 [2024-12-02 06:07:08,986 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 903 mSDsluCounter, 3884 mSDsCounter, 0 mSdLazyCounter, 5559 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 4131 SdHoareTripleChecker+Invalid, 5594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 5559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:07:08,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 4131 Invalid, 5594 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [35 Valid, 5559 Invalid, 0 Unknown, 0 Unchecked, 22.4s Time] [2024-12-02 06:07:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-12-02 06:07:08,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 596. [2024-12-02 06:07:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 434 states have (on average 1.5345622119815667) internal successors, (666), 590 states have internal predecessors, (666), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:07:08,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 672 transitions. [2024-12-02 06:07:08,991 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 672 transitions. Word has length 104 [2024-12-02 06:07:08,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:07:08,992 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 672 transitions. [2024-12-02 06:07:08,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 6.7) internal successors, (201), 32 states have internal predecessors, (201), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:07:08,992 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 672 transitions. [2024-12-02 06:07:08,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-02 06:07:08,993 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:07:08,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:07:09,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 06:07:09,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:07:09,193 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:07:09,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:07:09,194 INFO L85 PathProgramCache]: Analyzing trace with hash -612948337, now seen corresponding path program 1 times [2024-12-02 06:07:09,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:07:09,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083767953] [2024-12-02 06:07:09,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:07:09,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:07:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:07:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:07:10,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:07:10,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083767953] [2024-12-02 06:07:10,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083767953] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:07:10,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:07:10,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-12-02 06:07:10,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027610586] [2024-12-02 06:07:10,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:07:10,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-02 06:07:10,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:07:10,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-02 06:07:10,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-12-02 06:07:10,453 INFO L87 Difference]: Start difference. First operand 596 states and 672 transitions. Second operand has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:07:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:07:22,573 INFO L93 Difference]: Finished difference Result 622 states and 701 transitions. [2024-12-02 06:07:22,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 06:07:22,574 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-12-02 06:07:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:07:22,576 INFO L225 Difference]: With dead ends: 622 [2024-12-02 06:07:22,576 INFO L226 Difference]: Without dead ends: 622 [2024-12-02 06:07:22,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-12-02 06:07:22,576 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 503 mSDsluCounter, 3669 mSDsCounter, 0 mSdLazyCounter, 3007 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 3994 SdHoareTripleChecker+Invalid, 3020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:07:22,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 3994 Invalid, 3020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3007 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2024-12-02 06:07:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-12-02 06:07:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 618. [2024-12-02 06:07:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 455 states have (on average 1.5142857142857142) internal successors, (689), 611 states have internal predecessors, (689), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:07:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 696 transitions. [2024-12-02 06:07:22,582 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 696 transitions. Word has length 106 [2024-12-02 06:07:22,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:07:22,582 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 696 transitions. [2024-12-02 06:07:22,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:07:22,583 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 696 transitions. [2024-12-02 06:07:22,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-02 06:07:22,583 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:07:22,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:07:22,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 06:07:22,583 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:07:22,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:07:22,584 INFO L85 PathProgramCache]: Analyzing trace with hash -612948336, now seen corresponding path program 1 times [2024-12-02 06:07:22,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:07:22,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853286289] [2024-12-02 06:07:22,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:07:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:07:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:07:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:07:25,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:07:25,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853286289] [2024-12-02 06:07:25,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853286289] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:07:25,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:07:25,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-12-02 06:07:25,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049616562] [2024-12-02 06:07:25,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:07:25,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 06:07:25,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:07:25,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 06:07:25,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-12-02 06:07:25,196 INFO L87 Difference]: Start difference. First operand 618 states and 696 transitions. Second operand has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:07:37,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:07:37,121 INFO L93 Difference]: Finished difference Result 621 states and 700 transitions. [2024-12-02 06:07:37,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 06:07:37,122 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-12-02 06:07:37,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:07:37,124 INFO L225 Difference]: With dead ends: 621 [2024-12-02 06:07:37,124 INFO L226 Difference]: Without dead ends: 621 [2024-12-02 06:07:37,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-12-02 06:07:37,125 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 502 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 2768 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 2784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-12-02 06:07:37,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 2716 Invalid, 2784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2768 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2024-12-02 06:07:37,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-12-02 06:07:37,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 618. [2024-12-02 06:07:37,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 455 states have (on average 1.512087912087912) internal successors, (688), 611 states have internal predecessors, (688), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:07:37,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 695 transitions. [2024-12-02 06:07:37,131 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 695 transitions. Word has length 106 [2024-12-02 06:07:37,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:07:37,131 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 695 transitions. [2024-12-02 06:07:37,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:07:37,131 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 695 transitions. [2024-12-02 06:07:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 06:07:37,132 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:07:37,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:07:37,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-02 06:07:37,132 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:07:37,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:07:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1003793498, now seen corresponding path program 1 times [2024-12-02 06:07:37,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:07:37,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534432434] [2024-12-02 06:07:37,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:07:37,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:07:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:07:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 06:07:37,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:07:37,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534432434] [2024-12-02 06:07:37,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534432434] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:07:37,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:07:37,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:07:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996964697] [2024-12-02 06:07:37,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:07:37,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 06:07:37,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:07:37,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 06:07:37,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:07:37,679 INFO L87 Difference]: Start difference. First operand 618 states and 695 transitions. Second operand has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:07:40,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:07:40,088 INFO L93 Difference]: Finished difference Result 617 states and 694 transitions. [2024-12-02 06:07:40,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:07:40,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2024-12-02 06:07:40,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:07:40,090 INFO L225 Difference]: With dead ends: 617 [2024-12-02 06:07:40,090 INFO L226 Difference]: Without dead ends: 617 [2024-12-02 06:07:40,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-12-02 06:07:40,091 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 2 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 06:07:40,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1591 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-12-02 06:07:40,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-12-02 06:07:40,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2024-12-02 06:07:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 455 states have (on average 1.5098901098901099) internal successors, (687), 610 states have internal predecessors, (687), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:07:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 694 transitions. [2024-12-02 06:07:40,097 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 694 transitions. Word has length 107 [2024-12-02 06:07:40,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:07:40,097 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 694 transitions. [2024-12-02 06:07:40,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:07:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 694 transitions. [2024-12-02 06:07:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 06:07:40,097 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:07:40,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:07:40,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-02 06:07:40,098 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:07:40,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:07:40,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1003793499, now seen corresponding path program 1 times [2024-12-02 06:07:40,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:07:40,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985115487] [2024-12-02 06:07:40,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:07:40,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:07:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:07:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:07:42,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:07:42,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985115487] [2024-12-02 06:07:42,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985115487] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:07:42,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647319311] [2024-12-02 06:07:42,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:07:42,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:07:42,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:07:42,879 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:07:42,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 06:07:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:07:43,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-12-02 06:07:43,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:07:43,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 06:07:43,684 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:07:43,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:07:43,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-12-02 06:07:43,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:07:44,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-12-02 06:07:44,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:07:44,807 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:07:44,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-02 06:07:44,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:07:45,249 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:07:45,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-12-02 06:07:45,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:07:45,639 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:07:45,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-12-02 06:07:45,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:07:45,993 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:07:45,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-12-02 06:07:46,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:07:46,362 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:07:46,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-12-02 06:07:46,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:07:46,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:07:46,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-12-02 06:07:46,663 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:07:46,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:07:46,739 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:07:46,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-02 06:07:46,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:07:46,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:07:46,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:07:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:07:46,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:07:47,172 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 44) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2903 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 40))))) is different from false [2024-12-02 06:07:47,887 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_9|) 0)) (forall ((v_ArrVal_2902 Int) (v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2901))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2900) .cse0 v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2902) (select (select (store .cse2 .cse0 v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_9|) 0))) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2900) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2901) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 40)))))) is different from false [2024-12-02 06:07:49,521 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2896))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2898))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2897) .cse0 v_ArrVal_2899) .cse1 v_ArrVal_2900) (select (select (store .cse2 .cse1 v_ArrVal_2901) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2903))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_9|) 0)))) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_9|) 0)) (forall ((v_ArrVal_2902 Int) (v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2896))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2898))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2901))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2897) .cse5 v_ArrVal_2899) .cse6 v_ArrVal_2900) .cse7 v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2902) (select (select (store .cse8 .cse7 v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-12-02 06:07:57,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:07:57,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-12-02 06:07:58,713 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (or (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2902 Int) (v_ArrVal_2903 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2895))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2896))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2898))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2901))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 43 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2894) .cse0 v_ArrVal_2897) .cse1 v_ArrVal_2899) .cse2 v_ArrVal_2900) .cse3 v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2902) (select (select (store .cse5 .cse3 v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_9| |c_ULTIMATE.start_main_#t~mem53#1.base|))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_37 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_prenex_34))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_prenex_33))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_prenex_31))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_prenex_35) .cse9 v_prenex_32) .cse10 v_prenex_30) .cse11 v_prenex_29) (select (select (store .cse12 .cse11 v_prenex_28) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_37))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))) is different from false [2024-12-02 06:08:02,962 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_9| .cse0) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2902 Int) (v_ArrVal_2903 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2895))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_2896))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_2898))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_2901))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2894) .cse1 v_ArrVal_2897) .cse2 v_ArrVal_2899) .cse3 v_ArrVal_2900) .cse4 v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2902) (select (select (store .cse6 .cse4 v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_37 (Array Int Int))) (< 0 (+ (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_34))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_prenex_33))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_prenex_31))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_35) .cse10 v_prenex_32) .cse11 v_prenex_30) .cse12 v_prenex_29) (select (select (store .cse13 .cse12 v_prenex_28) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_37))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 41)))))) is different from false [2024-12-02 06:08:07,662 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2910 (Array Int Int)) (v_ArrVal_2909 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2909))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2902 Int) (v_ArrVal_2903 (Array Int Int))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_2895))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_2896))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_2898))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_2901))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2910) .cse0 v_ArrVal_2894) .cse1 v_ArrVal_2897) .cse2 v_ArrVal_2899) .cse3 v_ArrVal_2900) .cse4 v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2902) (select (select (store .cse6 .cse4 v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_9| .cse0))))) (forall ((v_ArrVal_2910 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_ArrVal_2909 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_37 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2909))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_prenex_34))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_prenex_33))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_prenex_31))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2910) .cse11 v_prenex_35) .cse12 v_prenex_32) .cse13 v_prenex_30) .cse14 v_prenex_29) (select (select (store .cse15 .cse14 v_prenex_28) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_37))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))) is different from false [2024-12-02 06:08:07,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647319311] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:08:07,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:08:07,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 28 [2024-12-02 06:08:07,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127221754] [2024-12-02 06:08:07,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:08:07,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-12-02 06:08:07,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:08:07,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-12-02 06:08:07,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1120, Unknown=40, NotChecked=450, Total=1806 [2024-12-02 06:08:07,713 INFO L87 Difference]: Start difference. First operand 617 states and 694 transitions. Second operand has 29 states, 26 states have (on average 5.423076923076923) internal successors, (141), 28 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:08:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:08:28,920 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-12-02 06:08:28,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-12-02 06:08:28,921 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 5.423076923076923) internal successors, (141), 28 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2024-12-02 06:08:28,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:08:28,922 INFO L225 Difference]: With dead ends: 619 [2024-12-02 06:08:28,922 INFO L226 Difference]: Without dead ends: 619 [2024-12-02 06:08:28,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=358, Invalid=2076, Unknown=40, NotChecked=606, Total=3080 [2024-12-02 06:08:28,923 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 490 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 3070 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 2974 SdHoareTripleChecker+Invalid, 3091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2024-12-02 06:08:28,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 2974 Invalid, 3091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3070 Invalid, 0 Unknown, 0 Unchecked, 18.6s Time] [2024-12-02 06:08:28,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-12-02 06:08:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 594. [2024-12-02 06:08:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 434 states have (on average 1.5299539170506913) internal successors, (664), 588 states have internal predecessors, (664), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:08:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 670 transitions. [2024-12-02 06:08:28,930 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 670 transitions. Word has length 107 [2024-12-02 06:08:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:08:28,930 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 670 transitions. [2024-12-02 06:08:28,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 5.423076923076923) internal successors, (141), 28 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:08:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 670 transitions. [2024-12-02 06:08:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-02 06:08:28,931 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:08:28,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:08:28,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-12-02 06:08:29,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-12-02 06:08:29,131 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:08:29,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:08:29,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1857688454, now seen corresponding path program 1 times [2024-12-02 06:08:29,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:08:29,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783491737] [2024-12-02 06:08:29,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:08:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:08:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:08:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:08:31,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:08:31,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783491737] [2024-12-02 06:08:31,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783491737] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:08:31,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:08:31,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-12-02 06:08:31,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798667552] [2024-12-02 06:08:31,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:08:31,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 06:08:31,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:08:31,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 06:08:31,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-12-02 06:08:31,275 INFO L87 Difference]: Start difference. First operand 594 states and 670 transitions. Second operand has 17 states, 16 states have (on average 6.6875) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:08:46,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:08:46,717 INFO L93 Difference]: Finished difference Result 645 states and 726 transitions. [2024-12-02 06:08:46,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 06:08:46,717 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.6875) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-12-02 06:08:46,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:08:46,719 INFO L225 Difference]: With dead ends: 645 [2024-12-02 06:08:46,719 INFO L226 Difference]: Without dead ends: 645 [2024-12-02 06:08:46,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-12-02 06:08:46,719 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 513 mSDsluCounter, 2863 mSDsCounter, 0 mSdLazyCounter, 2538 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 3194 SdHoareTripleChecker+Invalid, 2553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:08:46,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 3194 Invalid, 2553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2538 Invalid, 0 Unknown, 0 Unchecked, 14.4s Time] [2024-12-02 06:08:46,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-12-02 06:08:46,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 619. [2024-12-02 06:08:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 458 states have (on average 1.5065502183406114) internal successors, (690), 612 states have internal predecessors, (690), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:08:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 697 transitions. [2024-12-02 06:08:46,725 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 697 transitions. Word has length 109 [2024-12-02 06:08:46,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:08:46,725 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 697 transitions. [2024-12-02 06:08:46,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.6875) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:08:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 697 transitions. [2024-12-02 06:08:46,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-02 06:08:46,726 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:08:46,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:08:46,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-02 06:08:46,726 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:08:46,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:08:46,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1857688455, now seen corresponding path program 1 times [2024-12-02 06:08:46,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:08:46,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204051612] [2024-12-02 06:08:46,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:08:46,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:08:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:08:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:08:49,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:08:49,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204051612] [2024-12-02 06:08:49,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204051612] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:08:49,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:08:49,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-12-02 06:08:49,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372038746] [2024-12-02 06:08:49,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:08:49,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 06:08:49,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:08:49,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 06:08:49,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-12-02 06:08:49,280 INFO L87 Difference]: Start difference. First operand 619 states and 697 transitions. Second operand has 16 states, 15 states have (on average 7.133333333333334) internal successors, (107), 16 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:09:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:09:05,211 INFO L93 Difference]: Finished difference Result 644 states and 725 transitions. [2024-12-02 06:09:05,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 06:09:05,212 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.133333333333334) internal successors, (107), 16 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-12-02 06:09:05,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:09:05,213 INFO L225 Difference]: With dead ends: 644 [2024-12-02 06:09:05,213 INFO L226 Difference]: Without dead ends: 644 [2024-12-02 06:09:05,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-12-02 06:09:05,214 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 532 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 2483 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 2499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2024-12-02 06:09:05,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 2701 Invalid, 2499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2483 Invalid, 0 Unknown, 0 Unchecked, 14.7s Time] [2024-12-02 06:09:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-12-02 06:09:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 619. [2024-12-02 06:09:05,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 458 states have (on average 1.5043668122270741) internal successors, (689), 612 states have internal predecessors, (689), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:09:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 696 transitions. [2024-12-02 06:09:05,220 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 696 transitions. Word has length 109 [2024-12-02 06:09:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:09:05,221 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 696 transitions. [2024-12-02 06:09:05,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.133333333333334) internal successors, (107), 16 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:09:05,221 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 696 transitions. [2024-12-02 06:09:05,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-02 06:09:05,221 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:09:05,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:09:05,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-12-02 06:09:05,222 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:09:05,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:09:05,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1844529701, now seen corresponding path program 1 times [2024-12-02 06:09:05,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:09:05,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657333522] [2024-12-02 06:09:05,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:09:05,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:09:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:09:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:09:07,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:09:07,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657333522] [2024-12-02 06:09:07,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657333522] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:09:07,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266554387] [2024-12-02 06:09:07,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:09:07,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:09:07,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:09:07,806 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:09:07,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 06:09:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:09:08,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-12-02 06:09:08,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:09:08,870 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:09:08,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:09:08,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:09:09,181 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:09:09,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:09:09,485 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:09:09,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:09:09,801 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:09:09,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:09:10,126 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:09:10,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:09:10,462 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:09:10,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:09:10,718 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:09:10,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:09:11,056 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:09:11,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:09:11,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:09:11,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:09:11,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:09:11,222 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-12-02 06:09:11,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-12-02 06:09:11,245 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3291 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem59#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3291) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-12-02 06:09:11,749 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3289 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3289) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-12-02 06:09:11,777 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3289 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3289) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-12-02 06:09:11,818 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3288))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3289)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-12-02 06:09:16,080 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3287 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3287))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3288)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3289)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-12-02 06:09:16,112 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3287 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3287))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3288)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3289)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-12-02 06:09:20,953 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3294 (Array Int Int)) (v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3287 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3294))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3286)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3287)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3288)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3289)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-12-02 06:09:20,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266554387] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:09:20,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:09:20,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 23 [2024-12-02 06:09:20,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944929128] [2024-12-02 06:09:20,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:09:20,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-12-02 06:09:20,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:09:20,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-12-02 06:09:20,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=637, Unknown=27, NotChecked=406, Total=1190 [2024-12-02 06:09:20,962 INFO L87 Difference]: Start difference. First operand 619 states and 696 transitions. Second operand has 24 states, 22 states have (on average 6.136363636363637) internal successors, (135), 24 states have internal predecessors, (135), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:09:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:09:46,909 INFO L93 Difference]: Finished difference Result 635 states and 714 transitions. [2024-12-02 06:09:46,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 06:09:46,910 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 6.136363636363637) internal successors, (135), 24 states have internal predecessors, (135), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-12-02 06:09:46,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:09:46,913 INFO L225 Difference]: With dead ends: 635 [2024-12-02 06:09:46,913 INFO L226 Difference]: Without dead ends: 635 [2024-12-02 06:09:46,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=228, Invalid=1255, Unknown=27, NotChecked=560, Total=2070 [2024-12-02 06:09:46,915 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 506 mSDsluCounter, 5205 mSDsCounter, 0 mSdLazyCounter, 4159 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 5528 SdHoareTripleChecker+Invalid, 4181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2024-12-02 06:09:46,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 5528 Invalid, 4181 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 4159 Invalid, 0 Unknown, 0 Unchecked, 24.3s Time] [2024-12-02 06:09:46,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-12-02 06:09:46,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 618. [2024-12-02 06:09:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 458 states have (on average 1.502183406113537) internal successors, (688), 611 states have internal predecessors, (688), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 06:09:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 695 transitions. [2024-12-02 06:09:46,921 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 695 transitions. Word has length 110 [2024-12-02 06:09:46,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:09:46,921 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 695 transitions. [2024-12-02 06:09:46,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 6.136363636363637) internal successors, (135), 24 states have internal predecessors, (135), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:09:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 695 transitions. [2024-12-02 06:09:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-02 06:09:46,922 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:09:46,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:09:46,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-12-02 06:09:47,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-12-02 06:09:47,122 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:09:47,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:09:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1844529700, now seen corresponding path program 1 times [2024-12-02 06:09:47,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:09:47,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996190238] [2024-12-02 06:09:47,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:09:47,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:09:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:09:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:09:50,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:09:50,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996190238] [2024-12-02 06:09:50,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996190238] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:09:50,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22511711] [2024-12-02 06:09:50,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:09:50,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:09:50,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:09:50,093 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:09:50,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 06:09:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:09:50,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-12-02 06:09:50,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:09:51,165 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:09:51,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:09:51,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:09:51,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:09:52,034 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:09:52,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:09:52,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:09:52,417 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:09:52,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:09:52,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:09:52,807 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:09:52,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:09:52,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:09:53,198 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:09:53,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:09:53,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:09:53,613 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:09:53,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:09:53,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:09:54,106 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:09:54,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-12-02 06:09:54,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-12-02 06:09:54,871 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:09:54,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-12-02 06:09:54,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-12-02 06:09:54,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-12-02 06:09:54,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-12-02 06:09:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:09:55,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:09:55,568 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3502 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3502) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-12-02 06:09:56,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:09:56,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 86 [2024-12-02 06:09:56,255 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_prenex_40))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~mem57#1.base|)) (forall ((v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3501) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_prenex_41) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ |c_ULTIMATE.start_main_#t~mem57#1.offset| 1))))) is different from false [2024-12-02 06:09:56,360 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_41) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1))) (forall ((v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (= .cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_40))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3501) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-12-02 06:09:56,480 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3498))) (< (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3499))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_prenex_41) (select (select (store .cse2 .cse1 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3499))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3498) .cse4 v_ArrVal_3501) (select (select (store .cse5 .cse4 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3503))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3499))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (let ((.cse6 (store .cse7 .cse8 v_prenex_40))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse8)))))) is different from false [2024-12-02 06:09:56,743 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3498))) (< (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3499))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_prenex_41) (select (select (store .cse2 .cse1 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3499))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3498) .cse5 v_ArrVal_3501) (select (select (store .cse6 .cse5 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3503))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3499))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (let ((.cse7 (store .cse8 .cse9 v_prenex_40))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse9))))))) is different from false [2024-12-02 06:09:56,937 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3496))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3497) .cse5 v_ArrVal_3498))) (< (select (select (let ((.cse2 (store .cse4 .cse5 v_ArrVal_3499))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_prenex_41) (select (select (store .cse2 .cse1 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))))) (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3496))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3499))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3497) .cse6 v_ArrVal_3498) .cse7 v_ArrVal_3501) (select (select (store .cse8 .cse7 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3503))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3496))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3499)))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse10 (select (select (let ((.cse11 (store .cse12 .cse10 v_prenex_40))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2024-12-02 06:09:57,096 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3496))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3499)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_prenex_40))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3496))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3497) .cse10 v_ArrVal_3498))) (< (select (select (let ((.cse8 (store .cse9 .cse10 v_ArrVal_3499))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store .cse6 .cse7 v_prenex_41) (select (select (store .cse8 .cse7 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))))) (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3496))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3499))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3497) .cse11 v_ArrVal_3498) .cse12 v_ArrVal_3501) (select (select (store .cse13 .cse12 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3503))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-12-02 06:09:57,341 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3495))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_3496))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3494) .cse6 v_ArrVal_3497) .cse5 v_ArrVal_3498))) (< (select (select (let ((.cse2 (store .cse4 .cse5 v_ArrVal_3499))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_prenex_41) (select (select (store .cse2 .cse1 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))))))) (forall ((v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3495))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3496)))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3499)))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse8 (select (select (let ((.cse9 (store .cse10 .cse8 v_prenex_40))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3495))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3496))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3499))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3494) .cse13 v_ArrVal_3497) .cse14 v_ArrVal_3498) .cse15 v_ArrVal_3501) (select (select (store .cse16 .cse15 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3503))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) is different from false [2024-12-02 06:09:57,624 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (forall ((v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3495))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3496))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3499))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3494) .cse1 v_ArrVal_3497) .cse2 v_ArrVal_3498) .cse3 v_ArrVal_3501) (select (select (store .cse4 .cse3 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3503))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3495))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3496)))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3499)))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse8 (select (select (let ((.cse9 (store .cse10 .cse8 v_prenex_40))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) (forall ((v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3495))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse19 .cse18 v_ArrVal_3496))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3494) .cse18 v_ArrVal_3497) .cse17 v_ArrVal_3498))) (< (select (select (let ((.cse15 (store .cse16 .cse17 v_ArrVal_3499))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store .cse13 .cse14 v_prenex_41) (select (select (store .cse15 .cse14 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (+ (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1))))))))))) is different from false [2024-12-02 06:09:58,009 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3493))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3495))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3496))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3499))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3492) .cse0 v_ArrVal_3494) .cse1 v_ArrVal_3497) .cse2 v_ArrVal_3498) .cse3 v_ArrVal_3501) (select (select (store .cse4 .cse3 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3503))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3493))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3495))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse16 .cse15 v_ArrVal_3496))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse9 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3492) .cse14 v_ArrVal_3494) .cse15 v_ArrVal_3497) .cse13 v_ArrVal_3498))) (< (select (select (let ((.cse11 (store .cse12 .cse13 v_ArrVal_3499))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store .cse9 .cse10 v_prenex_41) (select (select (store .cse11 .cse10 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (+ (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1)))))))))) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse20 (let ((.cse21 (let ((.cse22 (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3493))) (store .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3495)))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3496)))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3499)))) (let ((.cse18 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse18 (select (select (let ((.cse19 (store .cse20 .cse18 v_prenex_40))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))) is different from false [2024-12-02 06:09:59,900 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3493))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3495))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3496))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_3499))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3492) .cse1 v_ArrVal_3494) .cse2 v_ArrVal_3497) .cse3 v_ArrVal_3498) .cse4 v_ArrVal_3501) (select (select (store .cse5 .cse4 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3503))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3493))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3495)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3496)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3499)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (= (select (select (let ((.cse10 (store .cse11 .cse12 v_prenex_40))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) .cse12)))) (forall ((v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3493))) (let ((.cse21 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse23 (store .cse24 .cse21 v_ArrVal_3495))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse19 (store .cse23 .cse22 v_ArrVal_3496))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse16 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3492) .cse21 v_ArrVal_3494) .cse22 v_ArrVal_3497) .cse20 v_ArrVal_3498))) (< (select (select (let ((.cse18 (store .cse19 .cse20 v_ArrVal_3499))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store .cse16 .cse17 v_prenex_41) (select (select (store .cse18 .cse17 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (+ (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 1))))))))))))) is different from false [2024-12-02 06:10:04,230 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3508))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3493)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3495)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3496)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3499)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_prenex_40))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3508))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3493))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3495))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_3496))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3509) .cse13 v_ArrVal_3492) .cse14 v_ArrVal_3494) .cse15 v_ArrVal_3497) .cse12 v_ArrVal_3498))) (< (select (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_3499))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store .cse8 .cse9 v_prenex_41) (select (select (store .cse10 .cse9 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))))))))))) (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3508))) (let ((.cse19 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse27 (store .cse28 .cse19 v_ArrVal_3493))) (let ((.cse20 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse26 (store .cse27 .cse20 v_ArrVal_3495))) (let ((.cse21 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse25 (store .cse26 .cse21 v_ArrVal_3496))) (let ((.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse24 (store .cse25 .cse22 v_ArrVal_3499))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3509) .cse19 v_ArrVal_3492) .cse20 v_ArrVal_3494) .cse21 v_ArrVal_3497) .cse22 v_ArrVal_3498) .cse23 v_ArrVal_3501) (select (select (store .cse24 .cse23 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3503))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-12-02 06:10:04,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22511711] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:10:04,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:10:04,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2024-12-02 06:10:04,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264381847] [2024-12-02 06:10:04,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:10:04,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-12-02 06:10:04,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:10:04,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-12-02 06:10:04,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=837, Unknown=23, NotChecked=828, Total=1806 [2024-12-02 06:10:04,245 INFO L87 Difference]: Start difference. First operand 618 states and 695 transitions. Second operand has 29 states, 26 states have (on average 5.730769230769231) internal successors, (149), 29 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:10:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:10:24,875 INFO L93 Difference]: Finished difference Result 634 states and 713 transitions. [2024-12-02 06:10:24,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 06:10:24,876 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 5.730769230769231) internal successors, (149), 29 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2024-12-02 06:10:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:10:24,878 INFO L225 Difference]: With dead ends: 634 [2024-12-02 06:10:24,878 INFO L226 Difference]: Without dead ends: 634 [2024-12-02 06:10:24,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=238, Invalid=1592, Unknown=24, NotChecked=1116, Total=2970 [2024-12-02 06:10:24,880 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 548 mSDsluCounter, 2630 mSDsCounter, 0 mSdLazyCounter, 3021 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 2948 SdHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:10:24,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 2948 Invalid, 3046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3021 Invalid, 0 Unknown, 0 Unchecked, 18.1s Time] [2024-12-02 06:10:24,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-12-02 06:10:24,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 592. [2024-12-02 06:10:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 434 states have (on average 1.5253456221198156) internal successors, (662), 586 states have internal predecessors, (662), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:10:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 668 transitions. [2024-12-02 06:10:24,887 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 668 transitions. Word has length 110 [2024-12-02 06:10:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:10:24,887 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 668 transitions. [2024-12-02 06:10:24,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 5.730769230769231) internal successors, (149), 29 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:10:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 668 transitions. [2024-12-02 06:10:24,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 06:10:24,888 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:10:24,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:10:24,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 06:10:25,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-12-02 06:10:25,088 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:10:25,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:10:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1743797443, now seen corresponding path program 1 times [2024-12-02 06:10:25,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:10:25,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140794912] [2024-12-02 06:10:25,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:10:25,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:10:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:10:25,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:10:25,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:10:25,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140794912] [2024-12-02 06:10:25,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140794912] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:10:25,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:10:25,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 06:10:25,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255365943] [2024-12-02 06:10:25,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:10:25,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:10:25,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:10:25,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:10:25,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:10:25,313 INFO L87 Difference]: Start difference. First operand 592 states and 668 transitions. Second operand has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:10:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:10:28,812 INFO L93 Difference]: Finished difference Result 591 states and 667 transitions. [2024-12-02 06:10:28,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:10:28,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-12-02 06:10:28,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:10:28,815 INFO L225 Difference]: With dead ends: 591 [2024-12-02 06:10:28,815 INFO L226 Difference]: Without dead ends: 591 [2024-12-02 06:10:28,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:10:28,815 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 5 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:10:28,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1571 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-12-02 06:10:28,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-12-02 06:10:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2024-12-02 06:10:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 434 states have (on average 1.523041474654378) internal successors, (661), 585 states have internal predecessors, (661), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:10:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 667 transitions. [2024-12-02 06:10:28,823 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 667 transitions. Word has length 112 [2024-12-02 06:10:28,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:10:28,824 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 667 transitions. [2024-12-02 06:10:28,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:10:28,824 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 667 transitions. [2024-12-02 06:10:28,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 06:10:28,824 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:10:28,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:10:28,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-12-02 06:10:28,824 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:10:28,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:10:28,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1743797444, now seen corresponding path program 1 times [2024-12-02 06:10:28,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:10:28,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396754658] [2024-12-02 06:10:28,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:10:28,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:10:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:10:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:10:29,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:10:29,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396754658] [2024-12-02 06:10:29,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396754658] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:10:29,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:10:29,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 06:10:29,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459562917] [2024-12-02 06:10:29,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:10:29,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:10:29,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:10:29,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:10:29,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:10:29,189 INFO L87 Difference]: Start difference. First operand 591 states and 667 transitions. Second operand has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:10:32,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:10:32,820 INFO L93 Difference]: Finished difference Result 590 states and 666 transitions. [2024-12-02 06:10:32,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:10:32,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-12-02 06:10:32,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:10:32,822 INFO L225 Difference]: With dead ends: 590 [2024-12-02 06:10:32,822 INFO L226 Difference]: Without dead ends: 590 [2024-12-02 06:10:32,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:10:32,823 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 4 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-12-02 06:10:32,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1577 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-12-02 06:10:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-12-02 06:10:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2024-12-02 06:10:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 434 states have (on average 1.5207373271889402) internal successors, (660), 584 states have internal predecessors, (660), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:10:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 666 transitions. [2024-12-02 06:10:32,828 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 666 transitions. Word has length 112 [2024-12-02 06:10:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:10:32,829 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 666 transitions. [2024-12-02 06:10:32,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:10:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 666 transitions. [2024-12-02 06:10:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-02 06:10:32,829 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:10:32,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:10:32,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-02 06:10:32,830 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:10:32,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:10:32,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1776853430, now seen corresponding path program 1 times [2024-12-02 06:10:32,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:10:32,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091797091] [2024-12-02 06:10:32,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:10:32,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:10:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:10:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:10:36,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:10:36,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091797091] [2024-12-02 06:10:36,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091797091] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:10:36,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:10:36,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-12-02 06:10:36,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391575957] [2024-12-02 06:10:36,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:10:36,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 06:10:36,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:10:36,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 06:10:36,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-12-02 06:10:36,313 INFO L87 Difference]: Start difference. First operand 590 states and 666 transitions. Second operand has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:10:58,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:10:58,744 INFO L93 Difference]: Finished difference Result 638 states and 719 transitions. [2024-12-02 06:10:58,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 06:10:58,745 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-12-02 06:10:58,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:10:58,747 INFO L225 Difference]: With dead ends: 638 [2024-12-02 06:10:58,747 INFO L226 Difference]: Without dead ends: 638 [2024-12-02 06:10:58,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-12-02 06:10:58,747 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 531 mSDsluCounter, 4257 mSDsCounter, 0 mSdLazyCounter, 3477 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 4578 SdHoareTripleChecker+Invalid, 3497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2024-12-02 06:10:58,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 4578 Invalid, 3497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3477 Invalid, 0 Unknown, 0 Unchecked, 20.6s Time] [2024-12-02 06:10:58,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-12-02 06:10:58,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 619. [2024-12-02 06:10:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 462 states have (on average 1.4913419913419914) internal successors, (689), 612 states have internal predecessors, (689), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-12-02 06:10:58,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 698 transitions. [2024-12-02 06:10:58,758 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 698 transitions. Word has length 113 [2024-12-02 06:10:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:10:58,758 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 698 transitions. [2024-12-02 06:10:58,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:10:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 698 transitions. [2024-12-02 06:10:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-02 06:10:58,759 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:10:58,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:10:58,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-12-02 06:10:58,760 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:10:58,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:10:58,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1776853429, now seen corresponding path program 1 times [2024-12-02 06:10:58,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:10:58,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607866601] [2024-12-02 06:10:58,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:10:58,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:10:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:11:01,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:11:01,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:11:01,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607866601] [2024-12-02 06:11:01,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607866601] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:11:01,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:11:01,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-12-02 06:11:01,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989823988] [2024-12-02 06:11:01,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:11:01,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 06:11:01,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:11:01,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 06:11:01,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-12-02 06:11:01,934 INFO L87 Difference]: Start difference. First operand 619 states and 698 transitions. Second operand has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:11:25,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:11:25,130 INFO L93 Difference]: Finished difference Result 637 states and 718 transitions. [2024-12-02 06:11:25,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-02 06:11:25,131 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-12-02 06:11:25,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:11:25,133 INFO L225 Difference]: With dead ends: 637 [2024-12-02 06:11:25,133 INFO L226 Difference]: Without dead ends: 637 [2024-12-02 06:11:25,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-12-02 06:11:25,134 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 524 mSDsluCounter, 3777 mSDsCounter, 0 mSdLazyCounter, 3610 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 4107 SdHoareTripleChecker+Invalid, 3628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2024-12-02 06:11:25,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 4107 Invalid, 3628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3610 Invalid, 0 Unknown, 0 Unchecked, 21.3s Time] [2024-12-02 06:11:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-12-02 06:11:25,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 619. [2024-12-02 06:11:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 461 states have (on average 1.492407809110629) internal successors, (688), 612 states have internal predecessors, (688), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-12-02 06:11:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 697 transitions. [2024-12-02 06:11:25,141 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 697 transitions. Word has length 113 [2024-12-02 06:11:25,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:11:25,141 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 697 transitions. [2024-12-02 06:11:25,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 06:11:25,141 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 697 transitions. [2024-12-02 06:11:25,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-02 06:11:25,142 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:11:25,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:11:25,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-12-02 06:11:25,142 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:11:25,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:11:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash -554119649, now seen corresponding path program 1 times [2024-12-02 06:11:25,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:11:25,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719962530] [2024-12-02 06:11:25,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:11:25,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:11:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:11:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:11:28,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:11:28,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719962530] [2024-12-02 06:11:28,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719962530] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:11:28,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999537237] [2024-12-02 06:11:28,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:11:28,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:11:28,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:11:28,918 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:11:28,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 06:11:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:11:29,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-12-02 06:11:29,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:11:30,003 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:11:30,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:11:30,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:11:30,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:11:30,871 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:11:30,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:11:30,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-12-02 06:11:31,207 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:11:31,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:11:31,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-12-02 06:11:31,562 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:11:31,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:11:31,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-12-02 06:11:31,931 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:11:31,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:11:31,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-12-02 06:11:32,308 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:11:32,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:11:32,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-12-02 06:11:32,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-02 06:11:33,050 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-12-02 06:11:33,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 63 [2024-12-02 06:11:33,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-12-02 06:11:33,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:11:33,829 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-12-02 06:11:33,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 58 [2024-12-02 06:11:33,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-12-02 06:11:33,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-12-02 06:11:34,306 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-12-02 06:11:34,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-12-02 06:11:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:11:34,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:11:34,442 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4079 (Array Int Int))) (or (not (= v_ArrVal_4078 (let ((.cse0 (+ 40 |c_ULTIMATE.start_main_#t~mem59#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base|) .cse0 (select v_ArrVal_4078 .cse0))))) (= (select |c_#valid| (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4078))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) 1))) is different from false [2024-12-02 06:11:34,502 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select |c_#memory_$Pointer$#1.base| .cse1) .cse2 (select v_ArrVal_4078 .cse2))) v_ArrVal_4078)) (= (select |c_#valid| (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4078))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1))))) is different from false [2024-12-02 06:11:34,660 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4076))) (or (= (select |c_#valid| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4078 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4078 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-12-02 06:11:34,687 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 272 treesize of output 184 [2024-12-02 06:11:34,796 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_16|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4076)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4078 (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4078 .cse4))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-12-02 06:11:34,928 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4076))) (or (= (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4078 .cse5))) v_ArrVal_4078)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-12-02 06:11:35,229 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4073)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4074))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4076)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4078 (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4078 .cse4))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-12-02 06:11:35,411 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4074))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4076)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4078 .cse5))) v_ArrVal_4078)))))))))) is different from false [2024-12-02 06:11:35,846 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4071)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse10 .cse9 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4072) .cse9 v_ArrVal_4074))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4076)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4078))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4078 .cse5))) v_ArrVal_4078)))))))))) is different from false [2024-12-02 06:11:35,985 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4071))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4072) .cse10 v_ArrVal_4074))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4076))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4078 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4078 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-12-02 06:11:36,257 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (v_ArrVal_4070 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4069)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4071))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4070) .cse9 v_ArrVal_4072) .cse10 v_ArrVal_4074))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4076)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4078))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4078 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4078 .cse5))))))))))))))) is different from false [2024-12-02 06:11:36,410 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (v_ArrVal_4070 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4069))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4071))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4070) .cse10 v_ArrVal_4072) .cse11 v_ArrVal_4074))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4076)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4078))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4078 .cse5))) v_ArrVal_4078)))))))))))))) is different from false [2024-12-02 06:11:36,717 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4070 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (v_ArrVal_4074 (Array Int Int)) (v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4068)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4069))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4071))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4067) .cse9 v_ArrVal_4070) .cse10 v_ArrVal_4072) .cse11 v_ArrVal_4074))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4076)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4078 .cse2))) v_ArrVal_4078)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4078))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-12-02 06:11:36,887 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4070 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (v_ArrVal_4074 (Array Int Int)) (v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4068))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4069))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4071))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4067) .cse10 v_ArrVal_4070) .cse11 v_ArrVal_4072) .cse12 v_ArrVal_4074))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4076)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4078 .cse4))) v_ArrVal_4078)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))))) is different from false [2024-12-02 06:11:37,398 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4070 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4084 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (v_ArrVal_4085 (Array Int Int)) (v_ArrVal_4074 (Array Int Int)) (v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4084)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_4068))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4069))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4071))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4085) .cse9 v_ArrVal_4067) .cse10 v_ArrVal_4070) .cse11 v_ArrVal_4072) .cse12 v_ArrVal_4074))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4076)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4078 .cse2))) v_ArrVal_4078)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4078))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))))) is different from false [2024-12-02 06:11:37,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999537237] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:11:37,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:11:37,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 32 [2024-12-02 06:11:37,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561307022] [2024-12-02 06:11:37,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:11:37,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-12-02 06:11:37,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:11:37,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-12-02 06:11:37,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=962, Unknown=14, NotChecked=1050, Total=2162 [2024-12-02 06:11:37,411 INFO L87 Difference]: Start difference. First operand 619 states and 697 transitions. Second operand has 33 states, 30 states have (on average 5.2) internal successors, (156), 33 states have internal predecessors, (156), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:11:57,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:11:57,644 INFO L93 Difference]: Finished difference Result 635 states and 716 transitions. [2024-12-02 06:11:57,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-12-02 06:11:57,645 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 5.2) internal successors, (156), 33 states have internal predecessors, (156), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 114 [2024-12-02 06:11:57,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:11:57,646 INFO L225 Difference]: With dead ends: 635 [2024-12-02 06:11:57,647 INFO L226 Difference]: Without dead ends: 635 [2024-12-02 06:11:57,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=254, Invalid=1950, Unknown=14, NotChecked=1442, Total=3660 [2024-12-02 06:11:57,648 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 525 mSDsluCounter, 3497 mSDsCounter, 0 mSdLazyCounter, 2986 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 3818 SdHoareTripleChecker+Invalid, 3011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2024-12-02 06:11:57,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 3818 Invalid, 3011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2986 Invalid, 0 Unknown, 0 Unchecked, 17.5s Time] [2024-12-02 06:11:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-12-02 06:11:57,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 618. [2024-12-02 06:11:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 461 states have (on average 1.490238611713666) internal successors, (687), 611 states have internal predecessors, (687), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-12-02 06:11:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 696 transitions. [2024-12-02 06:11:57,655 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 696 transitions. Word has length 114 [2024-12-02 06:11:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:11:57,655 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 696 transitions. [2024-12-02 06:11:57,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 5.2) internal successors, (156), 33 states have internal predecessors, (156), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:11:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 696 transitions. [2024-12-02 06:11:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-02 06:11:57,656 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:11:57,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:11:57,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-12-02 06:11:57,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-12-02 06:11:57,856 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:11:57,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:11:57,857 INFO L85 PathProgramCache]: Analyzing trace with hash -554119648, now seen corresponding path program 1 times [2024-12-02 06:11:57,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:11:57,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126011242] [2024-12-02 06:11:57,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:11:57,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:11:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:12:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:12:01,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:12:01,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126011242] [2024-12-02 06:12:01,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126011242] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:12:01,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138993705] [2024-12-02 06:12:01,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:12:01,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:12:01,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:12:01,911 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:12:01,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-02 06:12:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:12:02,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-12-02 06:12:02,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:12:03,009 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:12:03,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:12:03,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:12:03,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:12:03,852 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:12:03,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:12:03,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-12-02 06:12:04,207 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:12:04,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:12:04,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-12-02 06:12:04,571 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:12:04,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:12:04,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-12-02 06:12:04,951 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:12:04,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:12:04,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-12-02 06:12:05,360 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:12:05,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:12:05,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-12-02 06:12:05,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 06:12:06,171 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-12-02 06:12:06,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 72 [2024-12-02 06:12:06,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2024-12-02 06:12:06,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:12:07,063 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-12-02 06:12:07,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 82 [2024-12-02 06:12:07,156 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-12-02 06:12:07,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 47 [2024-12-02 06:12:08,061 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-12-02 06:12:08,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 29 [2024-12-02 06:12:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:12:08,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:12:09,509 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base|)) (.cse6 (+ 40 |c_ULTIMATE.start_main_#t~mem59#1.offset|))) (and (forall ((v_ArrVal_4295 (Array Int Int))) (or (forall ((v_ArrVal_4297 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| (store .cse5 .cse6 v_ArrVal_4297))) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4295))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select .cse0 .cse1) .cse2) 384) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (= (store .cse7 .cse6 (select v_ArrVal_4295 .cse6)) v_ArrVal_4295)))) (forall ((v_ArrVal_4295 (Array Int Int))) (or (forall ((v_ArrVal_4297 Int)) (<= 0 (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| (store .cse5 .cse6 v_ArrVal_4297)))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (not (= (store .cse7 .cse6 (select v_ArrVal_4295 .cse6)) v_ArrVal_4295)))))) is different from false [2024-12-02 06:12:09,668 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse8)) (.cse9 (select |c_#memory_$Pointer$#1.offset| .cse8))) (and (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse0) (forall ((v_ArrVal_4295 (Array Int Int))) (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4295 (store .cse1 .cse2 (select v_ArrVal_4295 .cse2)))) (forall ((v_ArrVal_4297 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse8 (store .cse9 .cse2 v_ArrVal_4297))) (.cse6 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4295))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse5 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (<= (+ (select (select .cse3 .cse4) .cse5) 384) (select |c_#length| (select (select .cse6 .cse4) .cse5))))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse0) (forall ((v_ArrVal_4295 (Array Int Int))) (let ((.cse10 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4295 (store .cse1 .cse10 (select v_ArrVal_4295 .cse10)))) (forall ((v_ArrVal_4297 Int)) (<= 0 (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse8 (store .cse9 .cse10 v_ArrVal_4297)))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)))))))))))))) is different from false [2024-12-02 06:12:09,985 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.base|))) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.offset|)))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse11 (select .cse6 .cse7)) (.cse9 (select .cse8 .cse7))) (and (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse0) (forall ((v_ArrVal_4295 (Array Int Int))) (let ((.cse10 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (forall ((v_ArrVal_4297 Int)) (let ((.cse1 (store .cse8 .cse7 (store .cse9 .cse10 v_ArrVal_4297))) (.cse4 (store .cse6 .cse7 v_ArrVal_4295))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ (select (select .cse1 .cse2) .cse3) 384) (select |c_#length| (select (select .cse4 .cse2) .cse3)))))) (not (= v_ArrVal_4295 (store .cse11 .cse10 (select v_ArrVal_4295 .cse10))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse0) (forall ((v_ArrVal_4295 (Array Int Int))) (let ((.cse12 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4295 (store .cse11 .cse12 (select v_ArrVal_4295 .cse12)))) (forall ((v_ArrVal_4297 Int)) (<= 0 (let ((.cse13 (store .cse8 .cse7 (store .cse9 .cse12 v_ArrVal_4297)))) (select (select .cse13 (select (select (store .cse6 .cse7 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) is different from false [2024-12-02 06:12:10,023 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 942 treesize of output 820 [2024-12-02 06:12:10,744 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| 0))) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|))) (and (forall ((v_prenex_60 (Array Int Int)) (v_prenex_62 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse2 (+ 40 v_prenex_62))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_prenex_60 .cse2)) v_prenex_60)) (< v_prenex_62 .cse3) (< 0 (+ (let ((.cse4 (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 v_prenex_61)))) (select (select .cse4 (select (select (store .cse0 .cse1 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1)))))) (forall ((v_ArrVal_4295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse10 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= (store (select .cse8 .cse9) .cse10 (select v_ArrVal_4295 .cse10)) v_ArrVal_4295)) (= (select (let ((.cse11 (store .cse8 .cse9 v_ArrVal_4295))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (select (select (store .cse6 .cse9 (store (select .cse6 .cse9) .cse10 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) |v_ULTIMATE.start_main_#t~malloc58#1.base_19|) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse3))))) (forall ((v_ArrVal_4295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse14 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= (store (select .cse12 .cse13) .cse14 (select v_ArrVal_4295 .cse14)) v_ArrVal_4295)) (< (let ((.cse15 (store .cse6 .cse13 (store (select .cse6 .cse13) .cse14 v_ArrVal_4297)))) (select (select .cse15 (select (select (store .cse12 .cse13 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse3)))))))) is different from false [2024-12-02 06:12:12,480 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4289)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4290))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4295))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 (store (select .cse4 .cse3) .cse5 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4295 .cse5)))))))))) (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4289)) (.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4290))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse17 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse13 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 0))) (.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse12 (+ 40 v_prenex_62))) (or (not (= (store (select .cse10 .cse11) .cse12 (select v_prenex_60 .cse12)) v_prenex_60)) (< v_prenex_62 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse14 (store .cse13 .cse11 (store (select .cse13 .cse11) .cse12 v_prenex_61)))) (select (select .cse14 (select (select (store .cse10 .cse11 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4289)) (.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4290))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse19 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (select .cse20 .cse21) .cse22 (select v_ArrVal_4295 .cse22)))) (< (let ((.cse23 (store .cse19 .cse21 (store (select .cse19 .cse21) .cse22 v_ArrVal_4297)))) (select (select .cse23 (select (select (store .cse20 .cse21 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1))))))))) is different from false [2024-12-02 06:12:12,998 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_4289)) (.cse6 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_4290))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< (let ((.cse1 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse5 v_ArrVal_4297)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_ArrVal_4295 (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4290 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse5 (select v_ArrVal_4295 .cse5))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse17 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_4289)) (.cse20 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_4290))) (let ((.cse18 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse19 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse13 (store .cse20 .cse18 (store (select .cse20 .cse18) .cse19 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse15 (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 0))) (.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse16 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= (select (let ((.cse12 (store .cse13 .cse14 v_ArrVal_4295))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse15 .cse14 (store (select .cse15 .cse14) .cse16 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) |v_ULTIMATE.start_main_#t~malloc58#1.base_19|) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_ArrVal_4295 (store (select .cse13 .cse14) .cse16 (select v_ArrVal_4295 .cse16)))))))))) (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse30 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_4289)) (.cse22 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_4290))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse24 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse26 (store .cse30 .cse23 (store (select .cse30 .cse23) .cse24 0))) (.cse25 (+ 40 v_prenex_62))) (or (not (= (store (let ((.cse21 (store .cse22 .cse23 (store v_ArrVal_4290 .cse24 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse25 (select v_prenex_60 .cse25)) v_prenex_60)) (< v_prenex_62 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (< 0 (+ (let ((.cse28 (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse27 (store .cse26 .cse29 (store (select .cse26 .cse29) .cse25 v_prenex_61)))) (select (select .cse27 (select (select (store .cse28 .cse29 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1)))))))))) is different from false [2024-12-02 06:12:15,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse6 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 v_prenex_62))) (or (< v_prenex_62 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse3 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_prenex_61)))) (select (select .cse2 (select (select (store .cse3 .cse4 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (not (= v_prenex_60 (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4290 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_60 .cse5))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4287))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4288) .cse24 v_ArrVal_4289)) (.cse18 (store .cse23 .cse24 v_ArrVal_4290))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse22 .cse19 (store (select .cse22 .cse19) .cse20 0))) (.cse17 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< (let ((.cse14 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse16 .cse15 (store (select .cse16 .cse15) .cse17 v_ArrVal_4297)))) (select (select .cse13 (select (select (store .cse14 .cse15 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (let ((.cse21 (store .cse18 .cse19 (store v_ArrVal_4290 .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse17 (select v_ArrVal_4295 .cse17))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4287))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse30 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4288) .cse35 v_ArrVal_4289)) (.cse33 (store .cse34 .cse35 v_ArrVal_4290))) (let ((.cse31 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse32 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store .cse33 .cse31 (store (select .cse33 .cse31) .cse32 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse25 (store .cse30 .cse31 (store (select .cse30 .cse31) .cse32 0))) (.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse28 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (select .cse26 .cse27) .cse28 (select v_ArrVal_4295 .cse28)))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse29 (store .cse26 .cse27 v_ArrVal_4295))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse25 .cse27 (store (select .cse25 .cse27) .cse28 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-12-02 06:12:17,532 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse6 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse3 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_ArrVal_4297)))) (select (select .cse2 (select (select (store .cse3 .cse4 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (not (= (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4290 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4295 .cse5)) v_ArrVal_4295))))))))) (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4287))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4288) .cse25 v_ArrVal_4289)) (.cse19 (store .cse24 .cse25 v_ArrVal_4290))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse21 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store .cse23 .cse20 (store (select .cse23 .cse20) .cse21 0))) (.cse18 (+ 40 v_prenex_62))) (or (< 0 (+ (let ((.cse15 (store .cse19 .cse20 (store (select .cse19 .cse20) .cse21 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse17 .cse16 (store (select .cse17 .cse16) .cse18 v_prenex_61)))) (select (select .cse14 (select (select (store .cse15 .cse16 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (< v_prenex_62 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_60 (store (let ((.cse22 (store .cse19 .cse20 (store v_ArrVal_4290 .cse21 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse18 (select v_prenex_60 .cse18))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4287))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4288) .cse36 v_ArrVal_4289)) (.cse34 (store .cse35 .cse36 v_ArrVal_4290))) (let ((.cse32 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse33 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse28 (store .cse34 .cse32 (store (select .cse34 .cse32) .cse33 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse26 (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 0))) (.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse30 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse27 (store .cse28 .cse29 v_ArrVal_4295))) (select .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse26 .cse29 (store (select .cse26 .cse29) .cse30 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4295 (store (select .cse28 .cse29) .cse30 (select v_ArrVal_4295 .cse30))))))))))))))) is different from false [2024-12-02 06:12:32,479 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4286))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4285) .cse13 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse3 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse4 (store (select .cse10 .cse4) .cse5 0))) (.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (let ((.cse2 (store .cse3 .cse4 (store v_ArrVal_4290 .cse5 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse6 (select v_ArrVal_4295 .cse6)) v_ArrVal_4295)) (< (let ((.cse8 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse0 .cse9 (store (select .cse0 .cse9) .cse6 v_ArrVal_4297)))) (select (select .cse7 (select (select (store .cse8 .cse9 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)))))))))) (forall ((v_ArrVal_4285 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4286))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse28 .cse27 v_ArrVal_4287))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4285) .cse27 v_ArrVal_4288) .cse26 v_ArrVal_4289)) (.cse16 (store .cse25 .cse26 v_ArrVal_4290))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (+ 40 v_prenex_62)) (.cse23 (store .cse24 .cse17 (store (select .cse24 .cse17) .cse18 0)))) (or (not (= v_prenex_60 (store (let ((.cse15 (store .cse16 .cse17 (store v_ArrVal_4290 .cse18 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse19 (select v_prenex_60 .cse19)))) (< 0 (+ (let ((.cse21 (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (store .cse23 .cse22 (store (select .cse23 .cse22) .cse19 v_prenex_61)))) (select (select .cse20 (select (select (store .cse21 .cse22 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (< v_prenex_62 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse41 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4286))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store .cse41 .cse40 v_ArrVal_4287))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4285) .cse40 v_ArrVal_4288) .cse39 v_ArrVal_4289)) (.cse37 (store .cse38 .cse39 v_ArrVal_4290))) (let ((.cse35 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse36 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse29 (store .cse37 .cse35 (store (select .cse37 .cse35) .cse36 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse32 (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 0))) (.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse31 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= (store (select .cse29 .cse30) .cse31 (select v_ArrVal_4295 .cse31)) v_ArrVal_4295)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse33 (store .cse29 .cse30 v_ArrVal_4295))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse32 .cse30 (store (select .cse32 .cse30) .cse31 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2024-12-02 06:12:33,143 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4285 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4286))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse15 .cse14 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4285) .cse14 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse6 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 v_prenex_62))) (or (< v_prenex_62 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse3 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_prenex_61)))) (select (select .cse2 (select (select (store .cse3 .cse4 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (not (= v_prenex_60 (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4290 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_60 .cse5))))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4286))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse28 .cse27 v_ArrVal_4287))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4285) .cse27 v_ArrVal_4288) .cse26 v_ArrVal_4289)) (.cse24 (store .cse25 .cse26 v_ArrVal_4290))) (let ((.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse23 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store .cse24 .cse22 (store (select .cse24 .cse22) .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse19 (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 0))) (.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse16 (store .cse17 .cse18 v_ArrVal_4295))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse19 .cse18 (store (select .cse19 .cse18) .cse20 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (select .cse17 .cse18) .cse20 (select v_ArrVal_4295 .cse20)))))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse42 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4286))) (let ((.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse39 (store .cse42 .cse41 v_ArrVal_4287))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4285) .cse41 v_ArrVal_4288) .cse40 v_ArrVal_4289)) (.cse31 (store .cse39 .cse40 v_ArrVal_4290))) (let ((.cse32 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse33 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse29 (store .cse38 .cse32 (store (select .cse38 .cse32) .cse33 0))) (.cse34 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (let ((.cse30 (store .cse31 .cse32 (store v_ArrVal_4290 .cse33 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse30 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse34 (select v_ArrVal_4295 .cse34)))) (< (let ((.cse36 (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse35 (store .cse29 .cse37 (store (select .cse29 .cse37) .cse34 v_ArrVal_4297)))) (select (select .cse35 (select (select (store .cse36 .cse37 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1))))))))))))) is different from false [2024-12-02 06:12:34,050 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4284))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_4286))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse15 .cse14 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4283) .cse13 v_ArrVal_4285) .cse14 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse2 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse9 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0)))) (or (not (= v_ArrVal_4295 (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4290 .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4295 .cse5)))) (< (let ((.cse7 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse9 .cse8 (store (select .cse9 .cse8) .cse5 v_ArrVal_4297)))) (select (select .cse6 (select (select (store .cse7 .cse8 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4284))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_4286))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_4287))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4283) .cse29 v_ArrVal_4285) .cse30 v_ArrVal_4288) .cse28 v_ArrVal_4289)) (.cse18 (store .cse27 .cse28 v_ArrVal_4290))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store .cse26 .cse19 (store (select .cse26 .cse19) .cse20 0))) (.cse21 (+ 40 v_prenex_62))) (or (not (= (store (let ((.cse17 (store .cse18 .cse19 (store v_ArrVal_4290 .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse21 (select v_prenex_60 .cse21)) v_prenex_60)) (< v_prenex_62 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse24 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store .cse22 .cse25 (store (select .cse22 .cse25) .cse21 v_prenex_61)))) (select (select .cse23 (select (select (store .cse24 .cse25 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1))))))))))))) (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4284))) (let ((.cse44 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse46 (store .cse47 .cse44 v_ArrVal_4286))) (let ((.cse45 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse42 (store .cse46 .cse45 v_ArrVal_4287))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4283) .cse44 v_ArrVal_4285) .cse45 v_ArrVal_4288) .cse43 v_ArrVal_4289)) (.cse41 (store .cse42 .cse43 v_ArrVal_4290))) (let ((.cse39 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse40 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store .cse41 .cse39 (store (select .cse41 .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse35 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse37 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 0)))) (or (not (= v_ArrVal_4295 (store (select .cse33 .cse34) .cse35 (select v_ArrVal_4295 .cse35)))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse36 (store .cse33 .cse34 v_ArrVal_4295))) (select .cse36 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse37 .cse34 (store (select .cse37 .cse34) .cse35 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-12-02 06:12:34,654 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4284))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_4286))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4283) .cse14 v_ArrVal_4285) .cse15 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse2 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0))) (.cse5 (+ 40 v_prenex_62))) (or (not (= v_prenex_60 (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4290 .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_60 .cse5)))) (< v_prenex_62 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse8 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse6 .cse9 (store (select .cse6 .cse9) .cse5 v_prenex_61)))) (select (select .cse7 (select (select (store .cse8 .cse9 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1))))))))))))) (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4284))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_4286))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_4287))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4283) .cse29 v_ArrVal_4285) .cse30 v_ArrVal_4288) .cse28 v_ArrVal_4289)) (.cse26 (store .cse27 .cse28 v_ArrVal_4290))) (let ((.cse24 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse25 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store .cse26 .cse24 (store (select .cse26 .cse24) .cse25 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse18 (store .cse23 .cse24 (store (select .cse23 .cse24) .cse25 0))) (.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse21 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse19 .cse20) .cse21 (select v_ArrVal_4295 .cse21)) v_ArrVal_4295)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse22 (store .cse19 .cse20 v_ArrVal_4295))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse18 .cse20 (store (select .cse18 .cse20) .cse21 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4284))) (let ((.cse45 (select (select .cse48 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse47 (store .cse48 .cse45 v_ArrVal_4286))) (let ((.cse46 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse43 (store .cse47 .cse46 v_ArrVal_4287))) (let ((.cse44 (select (select .cse43 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse42 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4283) .cse45 v_ArrVal_4285) .cse46 v_ArrVal_4288) .cse44 v_ArrVal_4289)) (.cse38 (store .cse43 .cse44 v_ArrVal_4290))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse40 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store .cse42 .cse39 (store (select .cse42 .cse39) .cse40 0))) (.cse37 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse35 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store .cse33 .cse36 (store (select .cse33 .cse36) .cse37 v_ArrVal_4297)))) (select (select .cse34 (select (select (store .cse35 .cse36 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (not (= v_ArrVal_4295 (store (let ((.cse41 (store .cse38 .cse39 (store v_ArrVal_4290 .cse40 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse41 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse37 (select v_ArrVal_4295 .cse37)))))))))))))))))) is different from false [2024-12-02 06:12:35,975 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (v_ArrVal_4283 (Array Int Int)) (v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4302 (Array Int Int)) (v_ArrVal_4303 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4302))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_4284))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_4286))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4303) .cse13 v_ArrVal_4283) .cse14 v_ArrVal_4285) .cse15 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse3 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse4 (store (select .cse10 .cse4) .cse5 0))) (.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (let ((.cse2 (store .cse3 .cse4 (store v_ArrVal_4290 .cse5 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse6 (select v_ArrVal_4295 .cse6)))) (< (let ((.cse8 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse0 .cse9 (store (select .cse0 .cse9) .cse6 v_ArrVal_4297)))) (select (select .cse7 (select (select (store .cse8 .cse9 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)))))))))))))) (forall ((v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (v_ArrVal_4283 (Array Int Int)) (v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4302 (Array Int Int)) (v_ArrVal_4303 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4302))) (let ((.cse30 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store .cse35 .cse30 v_ArrVal_4284))) (let ((.cse31 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store .cse34 .cse31 v_ArrVal_4286))) (let ((.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse28 (store .cse33 .cse32 v_ArrVal_4287))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4303) .cse30 v_ArrVal_4283) .cse31 v_ArrVal_4285) .cse32 v_ArrVal_4288) .cse29 v_ArrVal_4289)) (.cse27 (store .cse28 .cse29 v_ArrVal_4290))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse19 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse20 .cse21) .cse22 (select v_ArrVal_4295 .cse22)) v_ArrVal_4295)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse23 (store .cse20 .cse21 v_ArrVal_4295))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse19 .cse21 (store (select .cse19 .cse21) .cse22 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))))) (forall ((v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int) (v_ArrVal_4283 (Array Int Int)) (v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4302 (Array Int Int)) (v_ArrVal_4303 (Array Int Int))) (let ((.cse53 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4302))) (let ((.cse48 (select (select .cse53 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse52 (store .cse53 .cse48 v_ArrVal_4284))) (let ((.cse49 (select (select .cse52 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse51 (store .cse52 .cse49 v_ArrVal_4286))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse46 (store .cse51 .cse50 v_ArrVal_4287))) (let ((.cse47 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse45 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4303) .cse48 v_ArrVal_4283) .cse49 v_ArrVal_4285) .cse50 v_ArrVal_4288) .cse47 v_ArrVal_4289)) (.cse37 (store .cse46 .cse47 v_ArrVal_4290))) (let ((.cse38 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse39 (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse40 (+ 40 v_prenex_62)) (.cse44 (store .cse45 .cse38 (store (select .cse45 .cse38) .cse39 0)))) (or (not (= v_prenex_60 (store (let ((.cse36 (store .cse37 .cse38 (store v_ArrVal_4290 .cse39 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse36 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse40 (select v_prenex_60 .cse40)))) (< 0 (+ (let ((.cse42 (store .cse37 .cse38 (store (select .cse37 .cse38) .cse39 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse41 (store .cse44 .cse43 (store (select .cse44 .cse43) .cse40 v_prenex_61)))) (select (select .cse41 (select (select (store .cse42 .cse43 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (< v_prenex_62 (select (select .cse44 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))))) is different from false [2024-12-02 06:12:36,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138993705] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:12:36,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:12:36,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 34 [2024-12-02 06:12:36,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467786218] [2024-12-02 06:12:36,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:12:36,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-12-02 06:12:36,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:12:36,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-12-02 06:12:36,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1345, Unknown=13, NotChecked=1118, Total=2652 [2024-12-02 06:12:36,223 INFO L87 Difference]: Start difference. First operand 618 states and 696 transitions. Second operand has 35 states, 32 states have (on average 4.90625) internal successors, (157), 35 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:13:08,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:13:08,779 INFO L93 Difference]: Finished difference Result 634 states and 715 transitions. [2024-12-02 06:13:08,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-12-02 06:13:08,780 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 4.90625) internal successors, (157), 35 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 114 [2024-12-02 06:13:08,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:13:08,781 INFO L225 Difference]: With dead ends: 634 [2024-12-02 06:13:08,781 INFO L226 Difference]: Without dead ends: 634 [2024-12-02 06:13:08,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=328, Invalid=2573, Unknown=13, NotChecked=1508, Total=4422 [2024-12-02 06:13:08,782 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 507 mSDsluCounter, 4401 mSDsCounter, 0 mSdLazyCounter, 4738 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 4719 SdHoareTripleChecker+Invalid, 4764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4738 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.9s IncrementalHoareTripleChecker+Time [2024-12-02 06:13:08,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 4719 Invalid, 4764 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 4738 Invalid, 2 Unknown, 0 Unchecked, 28.9s Time] [2024-12-02 06:13:08,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-12-02 06:13:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 588. [2024-12-02 06:13:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 433 states have (on average 1.5196304849884525) internal successors, (658), 582 states have internal predecessors, (658), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:13:08,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 664 transitions. [2024-12-02 06:13:08,788 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 664 transitions. Word has length 114 [2024-12-02 06:13:08,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:13:08,788 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 664 transitions. [2024-12-02 06:13:08,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 4.90625) internal successors, (157), 35 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:13:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 664 transitions. [2024-12-02 06:13:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-02 06:13:08,789 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:13:08,789 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:13:08,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-12-02 06:13:08,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-12-02 06:13:08,990 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:13:08,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:13:08,990 INFO L85 PathProgramCache]: Analyzing trace with hash -655482028, now seen corresponding path program 1 times [2024-12-02 06:13:08,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:13:08,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543542057] [2024-12-02 06:13:08,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:13:08,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:13:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:13:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 06:13:09,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:13:09,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543542057] [2024-12-02 06:13:09,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543542057] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:13:09,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:13:09,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:13:09,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777415406] [2024-12-02 06:13:09,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:13:09,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 06:13:09,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:13:09,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 06:13:09,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 06:13:09,128 INFO L87 Difference]: Start difference. First operand 588 states and 664 transitions. Second operand has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:13:11,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:13:11,448 INFO L93 Difference]: Finished difference Result 691 states and 799 transitions. [2024-12-02 06:13:11,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 06:13:11,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 123 [2024-12-02 06:13:11,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:13:11,450 INFO L225 Difference]: With dead ends: 691 [2024-12-02 06:13:11,450 INFO L226 Difference]: Without dead ends: 691 [2024-12-02 06:13:11,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:13:11,450 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 887 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 06:13:11,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 600 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-12-02 06:13:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-12-02 06:13:11,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2024-12-02 06:13:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 543 states have (on average 1.4604051565377532) internal successors, (793), 685 states have internal predecessors, (793), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:13:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 799 transitions. [2024-12-02 06:13:11,457 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 799 transitions. Word has length 123 [2024-12-02 06:13:11,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:13:11,457 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 799 transitions. [2024-12-02 06:13:11,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:13:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 799 transitions. [2024-12-02 06:13:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-02 06:13:11,458 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:13:11,458 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:13:11,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-12-02 06:13:11,458 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:13:11,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:13:11,458 INFO L85 PathProgramCache]: Analyzing trace with hash -655482027, now seen corresponding path program 1 times [2024-12-02 06:13:11,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:13:11,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119889802] [2024-12-02 06:13:11,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:13:11,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:13:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:13:11,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 06:13:11,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:13:11,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119889802] [2024-12-02 06:13:11,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119889802] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:13:11,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:13:11,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 06:13:11,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849203341] [2024-12-02 06:13:11,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:13:11,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:13:11,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:13:11,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:13:11,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:13:11,761 INFO L87 Difference]: Start difference. First operand 691 states and 799 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:13:14,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:13:14,914 INFO L93 Difference]: Finished difference Result 902 states and 1046 transitions. [2024-12-02 06:13:14,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:13:14,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 123 [2024-12-02 06:13:14,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:13:14,916 INFO L225 Difference]: With dead ends: 902 [2024-12-02 06:13:14,916 INFO L226 Difference]: Without dead ends: 902 [2024-12-02 06:13:14,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:13:14,916 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 1345 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:13:14,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 741 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-12-02 06:13:14,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-12-02 06:13:14,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 856. [2024-12-02 06:13:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 708 states have (on average 1.4562146892655368) internal successors, (1031), 850 states have internal predecessors, (1031), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:13:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1037 transitions. [2024-12-02 06:13:14,926 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1037 transitions. Word has length 123 [2024-12-02 06:13:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:13:14,927 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1037 transitions. [2024-12-02 06:13:14,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:13:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1037 transitions. [2024-12-02 06:13:14,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-12-02 06:13:14,927 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:13:14,928 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:13:14,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-12-02 06:13:14,928 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:13:14,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:13:14,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1154894375, now seen corresponding path program 1 times [2024-12-02 06:13:14,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:13:14,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178918331] [2024-12-02 06:13:14,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:13:14,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:13:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:13:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 06:13:15,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:13:15,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178918331] [2024-12-02 06:13:15,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178918331] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:13:15,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571597324] [2024-12-02 06:13:15,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:13:15,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:13:15,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:13:15,171 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:13:15,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-02 06:13:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:13:15,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-12-02 06:13:15,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:13:16,366 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:13:16,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:13:16,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:13:17,133 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:13:17,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:13:17,395 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:13:17,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:13:17,653 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:13:17,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:13:17,911 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:13:17,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:13:18,227 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:13:18,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:13:18,767 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:13:18,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:13:18,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-12-02 06:13:19,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:13:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:13:19,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 06:13:19,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571597324] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:13:19,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 06:13:19,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [4] total 20 [2024-12-02 06:13:19,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730473672] [2024-12-02 06:13:19,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:13:19,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-12-02 06:13:19,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:13:19,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-12-02 06:13:19,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-12-02 06:13:19,938 INFO L87 Difference]: Start difference. First operand 856 states and 1037 transitions. Second operand has 18 states, 16 states have (on average 7.5) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:13:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:13:33,316 INFO L93 Difference]: Finished difference Result 897 states and 1082 transitions. [2024-12-02 06:13:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 06:13:33,316 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 7.5) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 124 [2024-12-02 06:13:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:13:33,318 INFO L225 Difference]: With dead ends: 897 [2024-12-02 06:13:33,318 INFO L226 Difference]: Without dead ends: 897 [2024-12-02 06:13:33,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2024-12-02 06:13:33,319 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 522 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2024-12-02 06:13:33,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 2525 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2024-12-02 06:13:33,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-12-02 06:13:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 893. [2024-12-02 06:13:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 743 states have (on average 1.4360699865410498) internal successors, (1067), 885 states have internal predecessors, (1067), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-12-02 06:13:33,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1079 transitions. [2024-12-02 06:13:33,332 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1079 transitions. Word has length 124 [2024-12-02 06:13:33,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:13:33,332 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1079 transitions. [2024-12-02 06:13:33,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 7.5) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:13:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1079 transitions. [2024-12-02 06:13:33,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-12-02 06:13:33,333 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:13:33,333 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:13:33,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-12-02 06:13:33,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-12-02 06:13:33,534 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:13:33,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:13:33,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1154894376, now seen corresponding path program 1 times [2024-12-02 06:13:33,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:13:33,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931522765] [2024-12-02 06:13:33,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:13:33,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:13:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:13:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 06:13:33,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:13:33,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931522765] [2024-12-02 06:13:33,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931522765] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:13:33,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047221756] [2024-12-02 06:13:33,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:13:33,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:13:33,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:13:33,848 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:13:33,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-12-02 06:13:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:13:34,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-12-02 06:13:34,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:13:36,109 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:13:36,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:13:36,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:13:36,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:13:37,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:13:37,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 40 [2024-12-02 06:13:37,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:13:37,702 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:13:37,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:13:37,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:13:38,095 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:13:38,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:13:38,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:13:38,515 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:13:38,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:13:38,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:13:39,000 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:13:39,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:13:39,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:13:39,479 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:13:39,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-12-02 06:13:39,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-12-02 06:13:40,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-12-02 06:13:40,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-12-02 06:13:41,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-12-02 06:13:41,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-12-02 06:13:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:13:41,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 06:13:41,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047221756] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:13:41,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 06:13:41,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [4] total 21 [2024-12-02 06:13:41,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668138601] [2024-12-02 06:13:41,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:13:41,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 06:13:41,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:13:41,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 06:13:41,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-12-02 06:13:41,412 INFO L87 Difference]: Start difference. First operand 893 states and 1079 transitions. Second operand has 19 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 19 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:13:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:13:56,978 INFO L93 Difference]: Finished difference Result 922 states and 1109 transitions. [2024-12-02 06:13:56,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-02 06:13:56,978 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 19 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 124 [2024-12-02 06:13:56,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:13:56,980 INFO L225 Difference]: With dead ends: 922 [2024-12-02 06:13:56,980 INFO L226 Difference]: Without dead ends: 922 [2024-12-02 06:13:56,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2024-12-02 06:13:56,981 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 599 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:13:56,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 2481 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2024-12-02 06:13:56,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-12-02 06:13:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 900. [2024-12-02 06:13:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 749 states have (on average 1.4325767690253672) internal successors, (1073), 891 states have internal predecessors, (1073), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-12-02 06:13:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1085 transitions. [2024-12-02 06:13:56,989 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1085 transitions. Word has length 124 [2024-12-02 06:13:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:13:56,989 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1085 transitions. [2024-12-02 06:13:56,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 19 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 06:13:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1085 transitions. [2024-12-02 06:13:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-12-02 06:13:56,990 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:13:56,990 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:13:56,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-12-02 06:13:57,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:13:57,191 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:13:57,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:13:57,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1026026702, now seen corresponding path program 1 times [2024-12-02 06:13:57,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:13:57,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206548682] [2024-12-02 06:13:57,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:13:57,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:13:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:13:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 06:13:57,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:13:57,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206548682] [2024-12-02 06:13:57,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206548682] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:13:57,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820021873] [2024-12-02 06:13:57,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:13:57,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:13:57,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:13:57,573 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:13:57,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-12-02 06:13:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:13:57,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-12-02 06:13:57,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:13:58,779 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:13:58,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:13:58,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:13:59,481 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:13:59,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:13:59,736 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:13:59,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:14:00,008 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:14:00,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:14:00,285 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:14:00,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:14:00,589 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:14:00,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:14:00,917 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:14:00,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:14:01,485 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:14:01,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:14:01,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-12-02 06:14:02,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:14:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:14:02,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:14:03,613 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5068 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_5068) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-12-02 06:14:03,642 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5068 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5068) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-12-02 06:14:03,722 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-12-02 06:14:03,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-12-02 06:14:04,186 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5067))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-12-02 06:14:04,238 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5066)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) is different from false [2024-12-02 06:14:04,756 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_5065))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-12-02 06:14:04,810 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5065))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-12-02 06:14:04,921 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int)) (v_ArrVal_5064 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5064))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5065)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-12-02 06:14:05,017 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int)) (v_ArrVal_5064 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5064))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5065)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-12-02 06:14:05,281 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int)) (v_ArrVal_5064 (Array Int Int)) (v_ArrVal_5063 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5063))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5064)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5065)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-12-02 06:14:05,520 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int)) (v_ArrVal_5064 (Array Int Int)) (v_ArrVal_5063 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5063))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5064)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5065)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5066)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_5067))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-12-02 06:14:06,446 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int)) (v_ArrVal_5071 (Array Int Int)) (v_ArrVal_5064 (Array Int Int)) (v_ArrVal_5063 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5071))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5063)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5064)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5065)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-12-02 06:14:06,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820021873] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:14:06,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:14:06,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 18] total 22 [2024-12-02 06:14:06,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593401966] [2024-12-02 06:14:06,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:14:06,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-12-02 06:14:06,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:14:06,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-12-02 06:14:06,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=617, Unknown=26, NotChecked=660, Total=1406 [2024-12-02 06:14:06,454 INFO L87 Difference]: Start difference. First operand 900 states and 1085 transitions. Second operand has 22 states, 21 states have (on average 10.857142857142858) internal successors, (228), 22 states have internal predecessors, (228), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 06:14:26,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:14:26,163 INFO L93 Difference]: Finished difference Result 874 states and 1056 transitions. [2024-12-02 06:14:26,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-12-02 06:14:26,164 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 10.857142857142858) internal successors, (228), 22 states have internal predecessors, (228), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 125 [2024-12-02 06:14:26,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:14:26,165 INFO L225 Difference]: With dead ends: 874 [2024-12-02 06:14:26,165 INFO L226 Difference]: Without dead ends: 870 [2024-12-02 06:14:26,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=250, Invalid=1748, Unknown=26, NotChecked=1056, Total=3080 [2024-12-02 06:14:26,166 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 497 mSDsluCounter, 3377 mSDsCounter, 0 mSdLazyCounter, 2812 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 3694 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2024-12-02 06:14:26,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 3694 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2812 Invalid, 0 Unknown, 0 Unchecked, 16.9s Time] [2024-12-02 06:14:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-12-02 06:14:26,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 866. [2024-12-02 06:14:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 718 states have (on average 1.4498607242339834) internal successors, (1041), 859 states have internal predecessors, (1041), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 06:14:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1049 transitions. [2024-12-02 06:14:26,178 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1049 transitions. Word has length 125 [2024-12-02 06:14:26,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:14:26,178 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1049 transitions. [2024-12-02 06:14:26,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 10.857142857142858) internal successors, (228), 22 states have internal predecessors, (228), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 06:14:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1049 transitions. [2024-12-02 06:14:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-12-02 06:14:26,179 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:14:26,179 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:14:26,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-12-02 06:14:26,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:14:26,379 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:14:26,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:14:26,380 INFO L85 PathProgramCache]: Analyzing trace with hash 84896648, now seen corresponding path program 1 times [2024-12-02 06:14:26,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:14:26,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973471721] [2024-12-02 06:14:26,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:14:26,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:14:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:14:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 06:14:26,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:14:26,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973471721] [2024-12-02 06:14:26,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973471721] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:14:26,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639500344] [2024-12-02 06:14:26,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:14:26,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:14:26,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:14:26,804 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:14:26,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-12-02 06:14:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:14:27,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-12-02 06:14:27,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:14:29,133 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:14:29,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:14:29,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:14:29,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-12-02 06:14:30,268 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:14:30,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:14:30,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:14:30,665 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:14:30,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:14:30,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:14:31,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:14:31,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 40 [2024-12-02 06:14:31,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:14:31,469 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:14:31,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:14:31,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:14:31,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:14:31,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:14:31,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:14:32,398 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:14:32,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:14:32,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:14:32,886 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:14:32,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-02 06:14:32,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:14:33,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-12-02 06:14:33,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:14:34,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:14:34,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:14:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 06:14:34,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:14:36,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:14:36,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2024-12-02 06:14:36,952 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5294 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem59#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_prenex_89 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem59#1.offset| 29))) (forall ((v_ArrVal_5293 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_5293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12))))) is different from false [2024-12-02 06:14:37,014 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_prenex_89 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 29))) (forall ((v_ArrVal_5293 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12))) (forall ((v_ArrVal_5294 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-12-02 06:14:37,123 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_5292))) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 29)))) (forall ((v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_5292) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_5291))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse2 (select (select (store .cse3 .cse2 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-12-02 06:14:37,233 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5292) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12))) (forall ((v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5292))) (< (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 29)))) (forall ((v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5291))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse3 (select (select (store .cse4 .cse3 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-12-02 06:14:37,363 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5289))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5291)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5289))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5290) .cse6 v_ArrVal_5292))) (< (select (select (store .cse4 (select (select (store .cse5 .cse6 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 29 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ 12 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5289))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5290) .cse7 v_ArrVal_5292) (select (select (store .cse8 .cse7 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5293))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-12-02 06:14:37,453 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5289))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_5290) .cse2 v_ArrVal_5292))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 29 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5289))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_5290) .cse5 v_ArrVal_5292) (select (select (store .cse6 .cse5 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5293))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 12))) (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5289))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5291)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse7 (select (select (store .cse8 .cse7 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) is different from false [2024-12-02 06:14:37,701 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_5288))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_5289))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_5287) .cse0 v_ArrVal_5290) .cse1 v_ArrVal_5292) (select (select (store .cse2 .cse1 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5293))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 12))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_5288))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse9 .cse8 v_ArrVal_5289))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_5287) .cse8 v_ArrVal_5290) .cse7 v_ArrVal_5292))) (< (select (select (store .cse5 (select (select (store .cse6 .cse7 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 29)))))))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse10 (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_5288))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5289)))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5291)))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (store .cse10 .cse11 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse11)))))) is different from false [2024-12-02 06:14:37,876 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5288))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse6 .cse5 v_ArrVal_5289))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_5287) .cse5 v_ArrVal_5290) .cse2 v_ArrVal_5292))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 29)))))))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5288))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_5289))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_5287) .cse7 v_ArrVal_5290) .cse8 v_ArrVal_5292) (select (select (store .cse9 .cse8 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5293))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 12))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5288))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5289)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5291)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (store .cse11 .cse12 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse12))))))) is different from false [2024-12-02 06:14:38,225 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_main_#t~mem54#1.offset|))) (and (forall ((v_ArrVal_5286 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_5286 .cse1)) v_ArrVal_5286)) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5286))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_5288))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_5289))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5285) .cse2 v_ArrVal_5287) .cse3 v_ArrVal_5290) .cse4 v_ArrVal_5292) (select (select (store .cse5 .cse4 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_5293))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 12))))) (forall ((v_ArrVal_5286 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_5286 .cse1)) v_ArrVal_5286)) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5286))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_5288))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_5289))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse9 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5285) .cse12 v_ArrVal_5287) .cse13 v_ArrVal_5290) .cse11 v_ArrVal_5292))) (< (select (select (store .cse9 (select (select (store .cse10 .cse11 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (+ 29 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))))))) (forall ((v_ArrVal_5286 (Array Int Int))) (or (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse17 (let ((.cse18 (let ((.cse19 (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5286))) (store .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_5288)))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_5289)))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_5291)))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (= .cse16 (select (select (store .cse17 .cse16 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))) (not (= (store .cse0 .cse1 (select v_ArrVal_5286 .cse1)) v_ArrVal_5286)))))) is different from false [2024-12-02 06:14:38,413 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse0 (select |c_#memory_$Pointer$#1.base| .cse2))) (and (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int)) (or (forall ((v_ArrVal_5286 (Array Int Int))) (or (not (= v_ArrVal_5286 (let ((.cse1 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store .cse0 .cse1 (select v_ArrVal_5286 .cse1))))) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ 12 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_5286))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_5288))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse6 (store .cse8 .cse4 v_ArrVal_5289))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_5285) .cse3 v_ArrVal_5287) .cse4 v_ArrVal_5290) .cse5 v_ArrVal_5292) (select (select (store .cse6 .cse5 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_ArrVal_5293))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)))))) (< .cse10 |v_ULTIMATE.start_main_#t~mem54#1.offset_35|))) (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int)) (or (< .cse10 |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (or (not (= v_ArrVal_5286 (let ((.cse11 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store .cse0 .cse11 (select v_ArrVal_5286 .cse11))))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse13 (let ((.cse14 (let ((.cse15 (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_5286))) (store .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_ArrVal_5288)))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_ArrVal_5289)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_ArrVal_5291)))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (= .cse12 (select (select (store .cse13 .cse12 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int)) (or (< .cse10 |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (or (not (= v_ArrVal_5286 (let ((.cse17 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store .cse0 .cse17 (select v_ArrVal_5286 .cse17))))) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_5286))) (let ((.cse21 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse23 (store .cse24 .cse21 v_ArrVal_5288))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse19 (store .cse23 .cse22 v_ArrVal_5289))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse18 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_5285) .cse21 v_ArrVal_5287) .cse22 v_ArrVal_5290) .cse20 v_ArrVal_5292))) (< (select (select (store .cse18 (select (select (store .cse19 .cse20 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) (+ (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) 29)))))))))))))))))) is different from false [2024-12-02 06:14:39,398 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5284))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5283))) (let ((.cse2 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ 12 (select (select (let ((.cse8 (store .cse9 .cse2 v_ArrVal_5286))) (let ((.cse3 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse8 .cse3 v_ArrVal_5288))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_5289))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store .cse0 .cse2 v_ArrVal_5285) .cse3 v_ArrVal_5287) .cse4 v_ArrVal_5290) .cse5 v_ArrVal_5292) (select (select (store .cse6 .cse5 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5293))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse9 .cse2) .cse10 (select v_ArrVal_5286 .cse10))) v_ArrVal_5286))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5284))) (or (< (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5283))) (let ((.cse15 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse19 (store .cse20 .cse15 v_ArrVal_5286))) (let ((.cse16 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse18 (store .cse19 .cse16 v_ArrVal_5288))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse18 .cse17 v_ArrVal_5289))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store (store (store (store .cse11 .cse15 v_ArrVal_5285) .cse16 v_ArrVal_5287) .cse17 v_ArrVal_5290) .cse14 v_ArrVal_5292))) (< (select (select (store .cse12 (select (select (store .cse13 .cse14 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 29)))))))))) (not (= (let ((.cse21 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse20 .cse15) .cse21 (select v_ArrVal_5286 .cse21))) v_ArrVal_5286))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (or (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5283))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse23 (let ((.cse24 (let ((.cse25 (let ((.cse26 (store .cse27 .cse28 v_ArrVal_5286))) (store .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5288)))) (store .cse25 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5289)))) (store .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5291)))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse22 (select (select (store .cse23 .cse22 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (not (= (let ((.cse29 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse27 .cse28) .cse29 (select v_ArrVal_5286 .cse29))) v_ArrVal_5286)))))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|))))) is different from false [2024-12-02 06:14:48,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5301 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5302 (Array Int Int)) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5302))) (let ((.cse0 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5301) .cse0 v_ArrVal_5284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (or (not (= (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store v_ArrVal_5283 .cse2 (select v_ArrVal_5286 .cse2))) v_ArrVal_5286)) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse3 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse8 (store .cse9 .cse0 v_ArrVal_5283))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5286)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5288)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5289)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5291)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store .cse3 .cse4 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse4)))))))))) (forall ((v_ArrVal_5301 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5302 (Array Int Int)) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5302))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5301) .cse21 v_ArrVal_5284))) (or (< (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (or (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse19 (store .cse20 .cse21 v_ArrVal_5283))) (let ((.cse14 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_5286))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_5288))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse17 .cse16 v_ArrVal_5289))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store (store (store (store .cse10 .cse14 v_ArrVal_5285) .cse15 v_ArrVal_5287) .cse16 v_ArrVal_5290) .cse13 v_ArrVal_5292))) (< (select (select (store .cse11 (select (select (store .cse12 .cse13 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ 29 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) (not (= (let ((.cse22 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store v_ArrVal_5283 .cse22 (select v_ArrVal_5286 .cse22))) v_ArrVal_5286))))))))) (forall ((v_ArrVal_5301 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5302 (Array Int Int)) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5302))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5301) .cse34 v_ArrVal_5284))) (or (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse23 (store .cse33 .cse34 v_ArrVal_5283))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= v_ArrVal_5286 (let ((.cse25 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse23 .cse24) .cse25 (select v_ArrVal_5286 .cse25))))) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse32 (store .cse23 .cse24 v_ArrVal_5286))) (let ((.cse27 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse27 v_ArrVal_5288))) (let ((.cse28 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse30 (store .cse31 .cse28 v_ArrVal_5289))) (let ((.cse29 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store .cse26 .cse24 v_ArrVal_5285) .cse27 v_ArrVal_5287) .cse28 v_ArrVal_5290) .cse29 v_ArrVal_5292) (select (select (store .cse30 .cse29 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5293))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12))))))) (< (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|)))))))) is different from false [2024-12-02 06:14:48,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639500344] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:14:48,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:14:48,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19] total 24 [2024-12-02 06:14:48,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577410098] [2024-12-02 06:14:48,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:14:48,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-12-02 06:14:48,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:14:48,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-12-02 06:14:48,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=720, Unknown=20, NotChecked=780, Total=1640 [2024-12-02 06:14:48,369 INFO L87 Difference]: Start difference. First operand 866 states and 1049 transitions. Second operand has 24 states, 23 states have (on average 10.434782608695652) internal successors, (240), 24 states have internal predecessors, (240), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 06:15:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:15:15,069 INFO L93 Difference]: Finished difference Result 876 states and 1058 transitions. [2024-12-02 06:15:15,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-12-02 06:15:15,070 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 10.434782608695652) internal successors, (240), 24 states have internal predecessors, (240), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 126 [2024-12-02 06:15:15,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:15:15,071 INFO L225 Difference]: With dead ends: 876 [2024-12-02 06:15:15,071 INFO L226 Difference]: Without dead ends: 874 [2024-12-02 06:15:15,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=309, Invalid=2169, Unknown=20, NotChecked=1284, Total=3782 [2024-12-02 06:15:15,072 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 489 mSDsluCounter, 4441 mSDsCounter, 0 mSdLazyCounter, 3832 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 4762 SdHoareTripleChecker+Invalid, 3848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2024-12-02 06:15:15,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 4762 Invalid, 3848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3832 Invalid, 0 Unknown, 0 Unchecked, 22.9s Time] [2024-12-02 06:15:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-12-02 06:15:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-12-02 06:15:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 725 states have (on average 1.4455172413793103) internal successors, (1048), 866 states have internal predecessors, (1048), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 06:15:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1056 transitions. [2024-12-02 06:15:15,079 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1056 transitions. Word has length 126 [2024-12-02 06:15:15,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:15:15,080 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1056 transitions. [2024-12-02 06:15:15,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 10.434782608695652) internal successors, (240), 24 states have internal predecessors, (240), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 06:15:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1056 transitions. [2024-12-02 06:15:15,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-12-02 06:15:15,080 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:15:15,081 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:15:15,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-12-02 06:15:15,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2024-12-02 06:15:15,281 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:15:15,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:15:15,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1224414959, now seen corresponding path program 2 times [2024-12-02 06:15:15,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:15:15,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959257223] [2024-12-02 06:15:15,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 06:15:15,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:15:15,313 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 06:15:15,313 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 06:15:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-02 06:15:16,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:15:16,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959257223] [2024-12-02 06:15:16,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959257223] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:15:16,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:15:16,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 06:15:16,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975466155] [2024-12-02 06:15:16,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:15:16,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 06:15:16,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:15:16,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 06:15:16,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:15:16,010 INFO L87 Difference]: Start difference. First operand 874 states and 1056 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 06:15:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:15:18,292 INFO L93 Difference]: Finished difference Result 894 states and 1080 transitions. [2024-12-02 06:15:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:15:18,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 128 [2024-12-02 06:15:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:15:18,294 INFO L225 Difference]: With dead ends: 894 [2024-12-02 06:15:18,294 INFO L226 Difference]: Without dead ends: 894 [2024-12-02 06:15:18,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 06:15:18,294 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 9 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:15:18,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2254 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-12-02 06:15:18,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-12-02 06:15:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 882. [2024-12-02 06:15:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 733 states have (on average 1.4351978171896316) internal successors, (1052), 874 states have internal predecessors, (1052), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 06:15:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1060 transitions. [2024-12-02 06:15:18,305 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1060 transitions. Word has length 128 [2024-12-02 06:15:18,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:15:18,306 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1060 transitions. [2024-12-02 06:15:18,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 06:15:18,306 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1060 transitions. [2024-12-02 06:15:18,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-02 06:15:18,307 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:15:18,307 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:15:18,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-12-02 06:15:18,307 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:15:18,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:15:18,307 INFO L85 PathProgramCache]: Analyzing trace with hash -276010185, now seen corresponding path program 1 times [2024-12-02 06:15:18,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:15:18,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373397765] [2024-12-02 06:15:18,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:15:18,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:15:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:15:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-02 06:15:18,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:15:18,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373397765] [2024-12-02 06:15:18,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373397765] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:15:18,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:15:18,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 06:15:18,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195398240] [2024-12-02 06:15:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:15:18,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 06:15:18,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:15:18,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 06:15:18,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 06:15:18,803 INFO L87 Difference]: Start difference. First operand 882 states and 1060 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 06:15:21,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:15:21,207 INFO L93 Difference]: Finished difference Result 902 states and 1084 transitions. [2024-12-02 06:15:21,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 06:15:21,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 129 [2024-12-02 06:15:21,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:15:21,209 INFO L225 Difference]: With dead ends: 902 [2024-12-02 06:15:21,209 INFO L226 Difference]: Without dead ends: 902 [2024-12-02 06:15:21,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 06:15:21,209 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 10 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2706 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:15:21,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2706 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-12-02 06:15:21,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-12-02 06:15:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 898. [2024-12-02 06:15:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 749 states have (on average 1.431241655540721) internal successors, (1072), 890 states have internal predecessors, (1072), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 06:15:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1080 transitions. [2024-12-02 06:15:21,217 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1080 transitions. Word has length 129 [2024-12-02 06:15:21,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:15:21,217 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1080 transitions. [2024-12-02 06:15:21,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 06:15:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1080 transitions. [2024-12-02 06:15:21,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-02 06:15:21,218 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:15:21,218 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:15:21,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-12-02 06:15:21,218 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:15:21,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:15:21,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1619411060, now seen corresponding path program 1 times [2024-12-02 06:15:21,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:15:21,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804973645] [2024-12-02 06:15:21,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:15:21,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:15:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:15:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-02 06:15:21,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:15:21,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804973645] [2024-12-02 06:15:21,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804973645] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:15:21,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:15:21,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 06:15:21,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353114323] [2024-12-02 06:15:21,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:15:21,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 06:15:21,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:15:21,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 06:15:21,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:15:21,717 INFO L87 Difference]: Start difference. First operand 898 states and 1080 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 06:15:23,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:15:23,391 INFO L93 Difference]: Finished difference Result 910 states and 1092 transitions. [2024-12-02 06:15:23,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:15:23,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 130 [2024-12-02 06:15:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:15:23,393 INFO L225 Difference]: With dead ends: 910 [2024-12-02 06:15:23,393 INFO L226 Difference]: Without dead ends: 910 [2024-12-02 06:15:23,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:15:23,393 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 4 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-12-02 06:15:23,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1861 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-12-02 06:15:23,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-12-02 06:15:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2024-12-02 06:15:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 761 states have (on average 1.4244415243101183) internal successors, (1084), 902 states have internal predecessors, (1084), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 06:15:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1092 transitions. [2024-12-02 06:15:23,401 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1092 transitions. Word has length 130 [2024-12-02 06:15:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:15:23,401 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1092 transitions. [2024-12-02 06:15:23,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 06:15:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1092 transitions. [2024-12-02 06:15:23,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-02 06:15:23,402 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:15:23,402 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:15:23,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-12-02 06:15:23,402 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:15:23,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:15:23,402 INFO L85 PathProgramCache]: Analyzing trace with hash 669432667, now seen corresponding path program 1 times [2024-12-02 06:15:23,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:15:23,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57556978] [2024-12-02 06:15:23,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:15:23,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:15:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:15:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-02 06:15:24,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:15:24,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57556978] [2024-12-02 06:15:24,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57556978] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:15:24,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:15:24,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 06:15:24,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922476169] [2024-12-02 06:15:24,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:15:24,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 06:15:24,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:15:24,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 06:15:24,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-12-02 06:15:24,351 INFO L87 Difference]: Start difference. First operand 910 states and 1092 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 06:15:27,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:15:27,908 INFO L93 Difference]: Finished difference Result 962 states and 1164 transitions. [2024-12-02 06:15:27,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 06:15:27,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 130 [2024-12-02 06:15:27,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:15:27,910 INFO L225 Difference]: With dead ends: 962 [2024-12-02 06:15:27,910 INFO L226 Difference]: Without dead ends: 962 [2024-12-02 06:15:27,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-12-02 06:15:27,910 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 30 mSDsluCounter, 3151 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3657 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-12-02 06:15:27,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3657 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-12-02 06:15:27,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-12-02 06:15:27,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 950. [2024-12-02 06:15:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 801 states have (on average 1.4232209737827715) internal successors, (1140), 942 states have internal predecessors, (1140), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 06:15:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1148 transitions. [2024-12-02 06:15:27,918 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1148 transitions. Word has length 130 [2024-12-02 06:15:27,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:15:27,918 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1148 transitions. [2024-12-02 06:15:27,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 06:15:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1148 transitions. [2024-12-02 06:15:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-02 06:15:27,919 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:15:27,919 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:15:27,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-12-02 06:15:27,919 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:15:27,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:15:27,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1056049972, now seen corresponding path program 1 times [2024-12-02 06:15:27,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:15:27,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502761028] [2024-12-02 06:15:27,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:15:27,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:15:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:15:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 06:15:28,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:15:28,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502761028] [2024-12-02 06:15:28,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502761028] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:15:28,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125670695] [2024-12-02 06:15:28,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:15:28,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:15:28,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:15:28,481 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:15:28,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-12-02 06:15:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:15:28,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-12-02 06:15:28,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:15:28,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 06:15:31,962 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 06:15:31,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 06:15:32,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-12-02 06:15:32,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:15:32,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:15:32,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-12-02 06:15:32,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-12-02 06:15:33,734 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset#1_#t~loopctr160_83| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_82| Int)) (and (<= |v_#Ultimate.C_memset#1_#t~loopctr160_83| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| 1)) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_82| 0) (<= |c_#Ultimate.C_memset#1_#t~loopctr160| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| 1)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base| (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| |c_#Ultimate.C_memset#1_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| |c_#Ultimate.C_memset#1_#ptr.offset|) 0))))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 1) (<= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 40)))) is different from true [2024-12-02 06:15:33,828 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset#1_#t~loopctr160_83| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_84| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_82| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base| (store (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| |c_#Ultimate.C_memset#1_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| |c_#Ultimate.C_memset#1_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_84| |c_#Ultimate.C_memset#1_#ptr.offset|) 0))) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_83| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| 1)) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_82| 0) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_84| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| 1)))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 1) (<= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 40)))) is different from true [2024-12-02 06:15:34,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:15:34,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:15:34,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:15:34,338 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2024-12-02 06:15:34,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 44 [2024-12-02 06:15:35,765 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-12-02 06:15:35,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 62 [2024-12-02 06:15:36,621 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:15:36,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:15:37,275 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:15:37,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:15:37,943 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:15:37,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:15:38,813 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2024-12-02 06:15:38,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 31 [2024-12-02 06:15:38,848 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-12-02 06:15:38,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2024-12-02 06:15:39,240 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:15:39,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:15:40,087 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:15:40,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:15:41,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-12-02 06:15:41,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-12-02 06:15:42,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:15:42,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-12-02 06:15:43,088 INFO L349 Elim1Store]: treesize reduction 12, result has 75.5 percent of original size [2024-12-02 06:15:43,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 49 [2024-12-02 06:15:43,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:15:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-12-02 06:15:44,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:15:45,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125670695] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:15:45,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:15:45,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 30] total 36 [2024-12-02 06:15:45,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933355610] [2024-12-02 06:15:45,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:15:45,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-12-02 06:15:45,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:15:45,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-12-02 06:15:45,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1252, Unknown=3, NotChecked=146, Total=1560 [2024-12-02 06:15:45,637 INFO L87 Difference]: Start difference. First operand 950 states and 1148 transitions. Second operand has 36 states, 35 states have (on average 7.085714285714285) internal successors, (248), 35 states have internal predecessors, (248), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 06:16:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:16:56,074 INFO L93 Difference]: Finished difference Result 958 states and 1160 transitions. [2024-12-02 06:16:56,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-12-02 06:16:56,075 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 7.085714285714285) internal successors, (248), 35 states have internal predecessors, (248), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 130 [2024-12-02 06:16:56,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:16:56,077 INFO L225 Difference]: With dead ends: 958 [2024-12-02 06:16:56,077 INFO L226 Difference]: Without dead ends: 956 [2024-12-02 06:16:56,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=246, Invalid=2202, Unknown=10, NotChecked=194, Total=2652 [2024-12-02 06:16:56,077 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 879 mSDsluCounter, 3627 mSDsCounter, 0 mSdLazyCounter, 4921 mSolverCounterSat, 29 mSolverCounterUnsat, 78 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 3875 SdHoareTripleChecker+Invalid, 6123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4921 IncrementalHoareTripleChecker+Invalid, 78 IncrementalHoareTripleChecker+Unknown, 1095 IncrementalHoareTripleChecker+Unchecked, 54.8s IncrementalHoareTripleChecker+Time [2024-12-02 06:16:56,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 3875 Invalid, 6123 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 4921 Invalid, 78 Unknown, 1095 Unchecked, 54.8s Time] [2024-12-02 06:16:56,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-12-02 06:16:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 951. [2024-12-02 06:16:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 802 states have (on average 1.4226932668329177) internal successors, (1141), 943 states have internal predecessors, (1141), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 06:16:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1149 transitions. [2024-12-02 06:16:56,085 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1149 transitions. Word has length 130 [2024-12-02 06:16:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:16:56,085 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1149 transitions. [2024-12-02 06:16:56,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 7.085714285714285) internal successors, (248), 35 states have internal predecessors, (248), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 06:16:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1149 transitions. [2024-12-02 06:16:56,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-02 06:16:56,086 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:16:56,086 INFO L218 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:16:56,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-12-02 06:16:56,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2024-12-02 06:16:56,286 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:16:56,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:16:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1200425259, now seen corresponding path program 2 times [2024-12-02 06:16:56,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:16:56,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000102461] [2024-12-02 06:16:56,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 06:16:56,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:16:56,321 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 06:16:56,322 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 06:16:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-02 06:16:57,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:16:57,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000102461] [2024-12-02 06:16:57,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000102461] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:16:57,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:16:57,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 06:16:57,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059861934] [2024-12-02 06:16:57,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:16:57,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 06:16:57,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:16:57,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 06:16:57,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 06:16:57,784 INFO L87 Difference]: Start difference. First operand 951 states and 1149 transitions. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 06:17:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:17:01,963 INFO L93 Difference]: Finished difference Result 963 states and 1161 transitions. [2024-12-02 06:17:01,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 06:17:01,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 131 [2024-12-02 06:17:01,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:17:01,965 INFO L225 Difference]: With dead ends: 963 [2024-12-02 06:17:01,965 INFO L226 Difference]: Without dead ends: 963 [2024-12-02 06:17:01,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-12-02 06:17:01,966 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 23 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2760 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-12-02 06:17:01,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2760 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-12-02 06:17:01,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-12-02 06:17:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2024-12-02 06:17:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 814 states have (on average 1.4164619164619165) internal successors, (1153), 955 states have internal predecessors, (1153), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 06:17:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1161 transitions. [2024-12-02 06:17:01,973 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1161 transitions. Word has length 131 [2024-12-02 06:17:01,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:17:01,974 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1161 transitions. [2024-12-02 06:17:01,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 06:17:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1161 transitions. [2024-12-02 06:17:01,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-02 06:17:01,974 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:17:01,974 INFO L218 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:17:01,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-12-02 06:17:01,974 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:17:01,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:17:01,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1241471141, now seen corresponding path program 1 times [2024-12-02 06:17:01,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:17:01,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362932736] [2024-12-02 06:17:01,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:17:01,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:17:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:17:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 06:17:03,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:17:03,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362932736] [2024-12-02 06:17:03,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362932736] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:17:03,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110910122] [2024-12-02 06:17:03,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:17:03,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:17:03,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:17:03,325 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:17:03,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-12-02 06:17:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:17:03,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-12-02 06:17:03,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:17:05,569 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:17:05,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:17:05,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:17:06,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-12-02 06:17:07,713 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:17:07,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:17:08,577 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:17:08,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:17:08,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-12-02 06:17:09,245 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:17:09,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:17:09,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-12-02 06:17:09,931 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:17:09,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:17:09,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-12-02 06:17:10,635 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:17:10,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 06:17:10,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-12-02 06:17:11,409 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:17:11,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:17:11,989 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-12-02 06:17:11,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 67 [2024-12-02 06:17:12,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2024-12-02 06:17:13,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:17:13,284 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-12-02 06:17:13,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 62 [2024-12-02 06:17:13,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2024-12-02 06:17:13,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-12-02 06:17:14,827 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-12-02 06:17:14,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 17 [2024-12-02 06:17:15,665 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-12-02 06:17:15,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 59 [2024-12-02 06:17:15,691 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 18 treesize of output 14 [2024-12-02 06:17:17,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:17:17,550 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-02 06:17:17,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:17:19,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110910122] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:17:19,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:17:19,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 21] total 28 [2024-12-02 06:17:19,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852615577] [2024-12-02 06:17:19,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:17:20,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-12-02 06:17:20,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:17:20,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-12-02 06:17:20,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=888, Unknown=12, NotChecked=0, Total=992 [2024-12-02 06:17:20,001 INFO L87 Difference]: Start difference. First operand 963 states and 1161 transitions. Second operand has 28 states, 26 states have (on average 9.038461538461538) internal successors, (235), 28 states have internal predecessors, (235), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 06:18:22,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:18:22,315 INFO L93 Difference]: Finished difference Result 979 states and 1181 transitions. [2024-12-02 06:18:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-12-02 06:18:22,316 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 9.038461538461538) internal successors, (235), 28 states have internal predecessors, (235), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 132 [2024-12-02 06:18:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:18:22,317 INFO L225 Difference]: With dead ends: 979 [2024-12-02 06:18:22,318 INFO L226 Difference]: Without dead ends: 977 [2024-12-02 06:18:22,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=255, Invalid=2595, Unknown=12, NotChecked=0, Total=2862 [2024-12-02 06:18:22,318 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 488 mSDsluCounter, 6297 mSDsCounter, 0 mSdLazyCounter, 4988 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 6612 SdHoareTripleChecker+Invalid, 5010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:18:22,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 6612 Invalid, 5010 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 4988 Invalid, 0 Unknown, 0 Unchecked, 54.1s Time] [2024-12-02 06:18:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-12-02 06:18:22,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2024-12-02 06:18:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 822 states have (on average 1.4184914841849148) internal successors, (1166), 963 states have internal predecessors, (1166), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 06:18:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1174 transitions. [2024-12-02 06:18:22,327 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1174 transitions. Word has length 132 [2024-12-02 06:18:22,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:18:22,327 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1174 transitions. [2024-12-02 06:18:22,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 9.038461538461538) internal successors, (235), 28 states have internal predecessors, (235), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 06:18:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1174 transitions. [2024-12-02 06:18:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-02 06:18:22,328 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:18:22,328 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:18:22,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-12-02 06:18:22,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2024-12-02 06:18:22,528 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:18:22,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:22,529 INFO L85 PathProgramCache]: Analyzing trace with hash -32735025, now seen corresponding path program 1 times [2024-12-02 06:18:22,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:22,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233770168] [2024-12-02 06:18:22,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:22,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-02 06:18:23,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:23,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233770168] [2024-12-02 06:18:23,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233770168] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:18:23,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624905810] [2024-12-02 06:18:23,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:23,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:18:23,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:18:23,839 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:18:23,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-12-02 06:18:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:24,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-12-02 06:18:24,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:18:25,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 06:18:26,219 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-12-02 06:18:26,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-12-02 06:18:26,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-12-02 06:18:26,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:18:27,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-12-02 06:18:27,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:18:30,148 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:18:30,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-12-02 06:18:30,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:18:31,385 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:18:31,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-12-02 06:18:31,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:18:32,300 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:18:32,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-12-02 06:18:32,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:18:33,264 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:18:33,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-12-02 06:18:33,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:18:34,272 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:18:34,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-12-02 06:18:34,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:18:35,396 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-12-02 06:18:35,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2024-12-02 06:18:35,699 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-12-02 06:18:35,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-12-02 06:18:36,493 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-12-02 06:18:36,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 57 [2024-12-02 06:18:36,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:18:37,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:18:38,061 INFO L349 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2024-12-02 06:18:38,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 60 [2024-12-02 06:18:38,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 06:18:40,080 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-12-02 06:18:40,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 21 [2024-12-02 06:18:40,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:18:42,066 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-12-02 06:18:42,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 77 [2024-12-02 06:18:42,091 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 38 treesize of output 13 [2024-12-02 06:18:43,597 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-12-02 06:18:43,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 24 [2024-12-02 06:18:43,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:18:44,136 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-02 06:18:44,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:18:46,401 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_6740 (Array Int Int)) (v_ArrVal_6739 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem64#1.base| v_ArrVal_6740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem64#1.base| v_ArrVal_6739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6740 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem64#1.base| v_ArrVal_6740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12))))) is different from false [2024-12-02 06:18:46,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624905810] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:18:46,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:18:46,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22] total 30 [2024-12-02 06:18:46,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667127670] [2024-12-02 06:18:46,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:18:46,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-12-02 06:18:46,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:46,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-12-02 06:18:46,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=947, Unknown=1, NotChecked=62, Total=1122 [2024-12-02 06:18:46,415 INFO L87 Difference]: Start difference. First operand 971 states and 1174 transitions. Second operand has 30 states, 28 states have (on average 8.642857142857142) internal successors, (242), 30 states have internal predecessors, (242), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 06:19:46,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:19:46,700 INFO L93 Difference]: Finished difference Result 985 states and 1190 transitions. [2024-12-02 06:19:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-12-02 06:19:46,701 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 8.642857142857142) internal successors, (242), 30 states have internal predecessors, (242), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 137 [2024-12-02 06:19:46,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:19:46,703 INFO L225 Difference]: With dead ends: 985 [2024-12-02 06:19:46,703 INFO L226 Difference]: Without dead ends: 981 [2024-12-02 06:19:46,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=252, Invalid=2103, Unknown=1, NotChecked=94, Total=2450 [2024-12-02 06:19:46,704 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 467 mSDsluCounter, 3864 mSDsCounter, 0 mSdLazyCounter, 4971 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 4182 SdHoareTripleChecker+Invalid, 4994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 4971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.5s IncrementalHoareTripleChecker+Time [2024-12-02 06:19:46,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 4182 Invalid, 4994 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 4971 Invalid, 0 Unknown, 0 Unchecked, 53.5s Time] [2024-12-02 06:19:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2024-12-02 06:19:46,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 964. [2024-12-02 06:19:46,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 816 states have (on average 1.4154411764705883) internal successors, (1155), 957 states have internal predecessors, (1155), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 06:19:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1161 transitions. [2024-12-02 06:19:46,712 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1161 transitions. Word has length 137 [2024-12-02 06:19:46,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:19:46,712 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1161 transitions. [2024-12-02 06:19:46,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 8.642857142857142) internal successors, (242), 30 states have internal predecessors, (242), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 06:19:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1161 transitions. [2024-12-02 06:19:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-02 06:19:46,712 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:19:46,713 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:19:46,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-12-02 06:19:46,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:19:46,913 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 06:19:46,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:19:46,913 INFO L85 PathProgramCache]: Analyzing trace with hash 830451230, now seen corresponding path program 1 times [2024-12-02 06:19:46,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:19:46,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73636882] [2024-12-02 06:19:46,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:19:46,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:19:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:19:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 06:19:48,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:19:48,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73636882] [2024-12-02 06:19:48,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73636882] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:19:48,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306792797] [2024-12-02 06:19:48,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:19:48,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:19:48,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:19:48,482 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:19:48,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0154af2-5cc7-47c3-b33d-fd55e4ea4df7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-12-02 06:19:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:19:48,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-12-02 06:19:48,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:19:50,753 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:19:50,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:19:51,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:19:52,674 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:19:52,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:19:53,226 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:19:53,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:19:53,786 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:19:53,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:19:54,368 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:19:54,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:19:54,994 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:19:54,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 06:19:55,687 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:19:55,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:19:56,896 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:19:56,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:19:57,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-12-02 06:19:59,671 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:19:59,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 06:19:59,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:20:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-02 06:20:00,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:20:01,623 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7019 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse0) v_ArrVal_7019) |c_ULTIMATE.start_main_~users~0#1.base|) .cse0))) 1)) is different from false [2024-12-02 06:20:02,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306792797] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:20:02,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 06:20:02,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 28 [2024-12-02 06:20:02,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148878171] [2024-12-02 06:20:02,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 06:20:02,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-12-02 06:20:02,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:20:02,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-12-02 06:20:02,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=829, Unknown=14, NotChecked=58, Total=992 [2024-12-02 06:20:02,510 INFO L87 Difference]: Start difference. First operand 964 states and 1161 transitions. Second operand has 28 states, 27 states have (on average 9.25925925925926) internal successors, (250), 28 states have internal predecessors, (250), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4)