./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX --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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:03:02,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:03:02,318 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 17:03:02,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:03:02,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:03:02,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:03:02,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:03:02,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:03:02,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:03:02,362 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:03:02,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:03:02,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:03:02,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:03:02,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:03:02,364 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:03:02,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:03:02,365 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:03:02,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:03:02,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:03:02,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:03:02,370 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 17:03:02,370 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 17:03:02,374 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 17:03:02,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:03:02,375 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:03:02,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:03:02,375 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 17:03:02,376 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:03:02,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:03:02,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:03:02,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:03:02,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:03:02,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:03:02,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:03:02,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:03:02,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:03:02,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:03:02,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:03:02,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:03:02,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:03:02,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:03:02,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:03:02,383 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-11-08 17:03:02,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:03:02,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:03:02,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:03:02,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:03:02,724 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:03:02,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i Unable to find full path for "g++" [2024-11-08 17:03:04,819 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:03:05,127 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:03:05,127 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2024-11-08 17:03:05,159 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/data/a2a257618/65588d42d6484d87bf1be191ef990224/FLAG2aa77669e [2024-11-08 17:03:05,375 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/data/a2a257618/65588d42d6484d87bf1be191ef990224 [2024-11-08 17:03:05,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:03:05,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:03:05,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:03:05,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:03:05,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:03:05,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:03:05" (1/1) ... [2024-11-08 17:03:05,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bff5bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:03:05, skipping insertion in model container [2024-11-08 17:03:05,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:03:05" (1/1) ... [2024-11-08 17:03:05,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:03:05,982 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:03:06,040 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:03:06,047 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:03:06,056 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:03:06,069 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:03:06,101 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:03:06,103 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:03:06,107 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:03:06,113 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:03:06,128 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:03:06,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:03:06,161 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:03:06,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:03:06,325 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:03:06,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:03:06 WrapperNode [2024-11-08 17:03:06,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:03:06,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:03:06,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:03:06,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:03:06,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:03:06" (1/1) ... [2024-11-08 17:03:06,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:03:06" (1/1) ... [2024-11-08 17:03:06,482 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1529 [2024-11-08 17:03:06,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:03:06,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:03:06,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:03:06,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:03:06,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:03:06" (1/1) ... [2024-11-08 17:03:06,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:03:06" (1/1) ... [2024-11-08 17:03:06,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:03:06" (1/1) ... [2024-11-08 17:03:06,612 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-08 17:03:06,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:03:06" (1/1) ... [2024-11-08 17:03:06,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:03:06" (1/1) ... [2024-11-08 17:03:06,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:03:06" (1/1) ... [2024-11-08 17:03:06,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:03:06" (1/1) ... [2024-11-08 17:03:06,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:03:06" (1/1) ... [2024-11-08 17:03:06,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:03:06" (1/1) ... [2024-11-08 17:03:06,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:03:06,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:03:06,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:03:06,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:03:06,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:03:06" (1/1) ... [2024-11-08 17:03:06,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:03:06,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:06,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:03:06,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:03:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:03:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:03:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:03:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:03:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-08 17:03:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-08 17:03:06,794 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-08 17:03:06,794 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-08 17:03:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 17:03:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:03:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 17:03:06,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 17:03:06,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 17:03:06,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 17:03:06,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 17:03:06,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:03:06,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:03:06,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:03:06,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:03:07,024 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:03:07,027 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:03:07,031 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 17:03:07,076 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 17:03:10,079 INFO L? ?]: Removed 1501 outVars from TransFormulas that were not future-live. [2024-11-08 17:03:10,080 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:03:10,134 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:03:10,134 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-08 17:03:10,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:03:10 BoogieIcfgContainer [2024-11-08 17:03:10,135 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:03:10,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:03:10,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:03:10,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:03:10,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:03:05" (1/3) ... [2024-11-08 17:03:10,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e930f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:03:10, skipping insertion in model container [2024-11-08 17:03:10,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:03:06" (2/3) ... [2024-11-08 17:03:10,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e930f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:03:10, skipping insertion in model container [2024-11-08 17:03:10,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:03:10" (3/3) ... [2024-11-08 17:03:10,143 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test4-1.i [2024-11-08 17:03:10,161 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:03:10,161 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-11-08 17:03:10,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:03:10,259 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;@616887ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:03:10,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-08 17:03:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 1438 states, 808 states have (on average 2.0693069306930694) internal successors, (1672), 1430 states have internal predecessors, (1672), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 17:03:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:03:10,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:10,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:03:10,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr627ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:10,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:10,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1482226, now seen corresponding path program 1 times [2024-11-08 17:03:10,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:10,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709914840] [2024-11-08 17:03:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:10,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:10,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:10,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709914840] [2024-11-08 17:03:10,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709914840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:10,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:10,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:03:10,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629611905] [2024-11-08 17:03:10,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:10,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:03:10,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:10,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:03:10,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:03:10,539 INFO L87 Difference]: Start difference. First operand has 1438 states, 808 states have (on average 2.0693069306930694) internal successors, (1672), 1430 states have internal predecessors, (1672), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-08 17:03:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:11,619 INFO L93 Difference]: Finished difference Result 1445 states and 1633 transitions. [2024-11-08 17:03:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:03:11,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-08 17:03:11,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:11,640 INFO L225 Difference]: With dead ends: 1445 [2024-11-08 17:03:11,640 INFO L226 Difference]: Without dead ends: 1441 [2024-11-08 17:03:11,642 INFO L431 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-11-08 17:03:11,646 INFO L432 NwaCegarLoop]: 1594 mSDtfsCounter, 30 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:11,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2574 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:03:11,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2024-11-08 17:03:11,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1432. [2024-11-08 17:03:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 813 states have (on average 1.982779827798278) internal successors, (1612), 1424 states have internal predecessors, (1612), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 17:03:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1624 transitions. [2024-11-08 17:03:11,753 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1624 transitions. Word has length 4 [2024-11-08 17:03:11,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:11,754 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 1624 transitions. [2024-11-08 17:03:11,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-08 17:03:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1624 transitions. [2024-11-08 17:03:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 17:03:11,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:11,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:11,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:03:11,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:11,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:11,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1134576318, now seen corresponding path program 1 times [2024-11-08 17:03:11,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:11,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943622518] [2024-11-08 17:03:11,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:11,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:11,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:11,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943622518] [2024-11-08 17:03:11,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943622518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:11,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:11,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:03:11,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641764789] [2024-11-08 17:03:11,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:11,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:03:11,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:11,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:03:11,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:03:11,908 INFO L87 Difference]: Start difference. First operand 1432 states and 1624 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-11-08 17:03:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:13,040 INFO L93 Difference]: Finished difference Result 1338 states and 1528 transitions. [2024-11-08 17:03:13,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:03:13,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-08 17:03:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:13,045 INFO L225 Difference]: With dead ends: 1338 [2024-11-08 17:03:13,045 INFO L226 Difference]: Without dead ends: 1338 [2024-11-08 17:03:13,046 INFO L431 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-11-08 17:03:13,047 INFO L432 NwaCegarLoop]: 896 mSDtfsCounter, 1363 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:13,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1369 Valid, 905 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:03:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2024-11-08 17:03:13,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1338. [2024-11-08 17:03:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 813 states have (on average 1.86469864698647) internal successors, (1516), 1330 states have internal predecessors, (1516), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 17:03:13,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1528 transitions. [2024-11-08 17:03:13,080 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1528 transitions. Word has length 7 [2024-11-08 17:03:13,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:13,080 INFO L471 AbstractCegarLoop]: Abstraction has 1338 states and 1528 transitions. [2024-11-08 17:03:13,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-11-08 17:03:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1528 transitions. [2024-11-08 17:03:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 17:03:13,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:13,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:13,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:03:13,082 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:13,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1134576319, now seen corresponding path program 1 times [2024-11-08 17:03:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:13,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216532267] [2024-11-08 17:03:13,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:13,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:13,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:13,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216532267] [2024-11-08 17:03:13,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216532267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:13,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:13,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:03:13,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55353970] [2024-11-08 17:03:13,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:13,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:03:13,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:13,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:03:13,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:03:13,224 INFO L87 Difference]: Start difference. First operand 1338 states and 1528 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-11-08 17:03:14,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:14,484 INFO L93 Difference]: Finished difference Result 1756 states and 2026 transitions. [2024-11-08 17:03:14,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:03:14,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-08 17:03:14,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:14,491 INFO L225 Difference]: With dead ends: 1756 [2024-11-08 17:03:14,492 INFO L226 Difference]: Without dead ends: 1756 [2024-11-08 17:03:14,492 INFO L431 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-11-08 17:03:14,493 INFO L432 NwaCegarLoop]: 1262 mSDtfsCounter, 826 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:14,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1893 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:03:14,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2024-11-08 17:03:14,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1602. [2024-11-08 17:03:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1087 states have (on average 1.8325666973321066) internal successors, (1992), 1594 states have internal predecessors, (1992), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 17:03:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2004 transitions. [2024-11-08 17:03:14,532 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2004 transitions. Word has length 7 [2024-11-08 17:03:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:14,532 INFO L471 AbstractCegarLoop]: Abstraction has 1602 states and 2004 transitions. [2024-11-08 17:03:14,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-11-08 17:03:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2004 transitions. [2024-11-08 17:03:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 17:03:14,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:14,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:14,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:03:14,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr621REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:14,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:14,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1142022877, now seen corresponding path program 1 times [2024-11-08 17:03:14,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:14,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029391823] [2024-11-08 17:03:14,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:14,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:14,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:14,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029391823] [2024-11-08 17:03:14,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029391823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:14,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:14,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:03:14,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044642818] [2024-11-08 17:03:14,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:14,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:03:14,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:14,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:03:14,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:03:14,644 INFO L87 Difference]: Start difference. First operand 1602 states and 2004 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-11-08 17:03:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:15,059 INFO L93 Difference]: Finished difference Result 2658 states and 3361 transitions. [2024-11-08 17:03:15,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:03:15,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-11-08 17:03:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:15,070 INFO L225 Difference]: With dead ends: 2658 [2024-11-08 17:03:15,070 INFO L226 Difference]: Without dead ends: 2656 [2024-11-08 17:03:15,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:03:15,073 INFO L432 NwaCegarLoop]: 1493 mSDtfsCounter, 1005 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 4242 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:15,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 4242 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:03:15,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2024-11-08 17:03:15,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2357. [2024-11-08 17:03:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 1842 states have (on average 1.8132464712269272) internal successors, (3340), 2346 states have internal predecessors, (3340), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:03:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3358 transitions. [2024-11-08 17:03:15,136 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3358 transitions. Word has length 8 [2024-11-08 17:03:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:15,136 INFO L471 AbstractCegarLoop]: Abstraction has 2357 states and 3358 transitions. [2024-11-08 17:03:15,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-11-08 17:03:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3358 transitions. [2024-11-08 17:03:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 17:03:15,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:15,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:15,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:03:15,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:15,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:15,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1758992263, now seen corresponding path program 1 times [2024-11-08 17:03:15,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:15,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146052704] [2024-11-08 17:03:15,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:15,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:15,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-11-08 17:03:15,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:15,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146052704] [2024-11-08 17:03:15,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146052704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:15,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:15,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:03:15,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053700389] [2024-11-08 17:03:15,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:15,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:03:15,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:15,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:03:15,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:03:15,281 INFO L87 Difference]: Start difference. First operand 2357 states and 3358 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-11-08 17:03:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:16,622 INFO L93 Difference]: Finished difference Result 2432 states and 3464 transitions. [2024-11-08 17:03:16,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:03:16,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-08 17:03:16,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:16,632 INFO L225 Difference]: With dead ends: 2432 [2024-11-08 17:03:16,632 INFO L226 Difference]: Without dead ends: 2432 [2024-11-08 17:03:16,633 INFO L431 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-11-08 17:03:16,635 INFO L432 NwaCegarLoop]: 869 mSDtfsCounter, 1632 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:16,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 1597 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 17:03:16,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2024-11-08 17:03:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2334. [2024-11-08 17:03:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2334 states, 1842 states have (on average 1.788273615635179) internal successors, (3294), 2323 states have internal predecessors, (3294), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:03:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 3312 transitions. [2024-11-08 17:03:16,709 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 3312 transitions. Word has length 14 [2024-11-08 17:03:16,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:16,709 INFO L471 AbstractCegarLoop]: Abstraction has 2334 states and 3312 transitions. [2024-11-08 17:03:16,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-11-08 17:03:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 3312 transitions. [2024-11-08 17:03:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 17:03:16,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:16,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:16,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:03:16,712 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:16,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:16,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1758992262, now seen corresponding path program 1 times [2024-11-08 17:03:16,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:16,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888191812] [2024-11-08 17:03:16,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:16,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:16,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:16,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888191812] [2024-11-08 17:03:16,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888191812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:16,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:16,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:03:16,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227259182] [2024-11-08 17:03:16,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:16,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:03:16,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:16,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:03:16,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:03:16,945 INFO L87 Difference]: Start difference. First operand 2334 states and 3312 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-11-08 17:03:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:18,624 INFO L93 Difference]: Finished difference Result 2804 states and 3786 transitions. [2024-11-08 17:03:18,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:03:18,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-08 17:03:18,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:18,633 INFO L225 Difference]: With dead ends: 2804 [2024-11-08 17:03:18,633 INFO L226 Difference]: Without dead ends: 2804 [2024-11-08 17:03:18,634 INFO L431 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-11-08 17:03:18,635 INFO L432 NwaCegarLoop]: 1329 mSDtfsCounter, 1242 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 2877 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:18,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 2877 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 17:03:18,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2024-11-08 17:03:18,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 2452. [2024-11-08 17:03:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 1960 states have (on average 1.7540816326530613) internal successors, (3438), 2441 states have internal predecessors, (3438), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:03:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3456 transitions. [2024-11-08 17:03:18,691 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3456 transitions. Word has length 14 [2024-11-08 17:03:18,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:18,691 INFO L471 AbstractCegarLoop]: Abstraction has 2452 states and 3456 transitions. [2024-11-08 17:03:18,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-11-08 17:03:18,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3456 transitions. [2024-11-08 17:03:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 17:03:18,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:18,694 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 17:03:18,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:03:18,695 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:18,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:18,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1995083698, now seen corresponding path program 1 times [2024-11-08 17:03:18,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:18,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560317219] [2024-11-08 17:03:18,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:18,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 17:03:18,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:18,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560317219] [2024-11-08 17:03:18,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560317219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:18,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:18,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:03:18,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775163957] [2024-11-08 17:03:18,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:18,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:03:18,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:18,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:03:18,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:03:18,959 INFO L87 Difference]: Start difference. First operand 2452 states and 3456 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-11-08 17:03:19,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:19,005 INFO L93 Difference]: Finished difference Result 2183 states and 3080 transitions. [2024-11-08 17:03:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:03:19,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 52 [2024-11-08 17:03:19,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:19,013 INFO L225 Difference]: With dead ends: 2183 [2024-11-08 17:03:19,013 INFO L226 Difference]: Without dead ends: 2183 [2024-11-08 17:03:19,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-08 17:03:19,015 INFO L432 NwaCegarLoop]: 1344 mSDtfsCounter, 51 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 2645 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-11-08 17:03:19,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 2645 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:03:19,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2024-11-08 17:03:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 2183. [2024-11-08 17:03:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 1714 states have (on average 1.7864644107351224) internal successors, (3062), 2172 states have internal predecessors, (3062), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:03:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3080 transitions. [2024-11-08 17:03:19,064 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3080 transitions. Word has length 52 [2024-11-08 17:03:19,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:19,064 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 3080 transitions. [2024-11-08 17:03:19,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-11-08 17:03:19,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3080 transitions. [2024-11-08 17:03:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 17:03:19,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:19,069 INFO L215 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] [2024-11-08 17:03:19,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:03:19,070 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:19,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:19,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1123904235, now seen corresponding path program 1 times [2024-11-08 17:03:19,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:19,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137234867] [2024-11-08 17:03:19,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:19,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:19,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:19,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137234867] [2024-11-08 17:03:19,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137234867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:19,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:19,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:03:19,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741281685] [2024-11-08 17:03:19,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:19,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:03:19,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:19,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:03:19,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:03:19,206 INFO L87 Difference]: Start difference. First operand 2183 states and 3080 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-11-08 17:03:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:19,307 INFO L93 Difference]: Finished difference Result 2209 states and 3098 transitions. [2024-11-08 17:03:19,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:03:19,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2024-11-08 17:03:19,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:19,319 INFO L225 Difference]: With dead ends: 2209 [2024-11-08 17:03:19,319 INFO L226 Difference]: Without dead ends: 2209 [2024-11-08 17:03:19,319 INFO L431 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-11-08 17:03:19,320 INFO L432 NwaCegarLoop]: 1336 mSDtfsCounter, 56 mSDsluCounter, 2599 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3935 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:19,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 3935 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:03:19,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2024-11-08 17:03:19,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 2207. [2024-11-08 17:03:19,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2207 states, 1738 states have (on average 1.7710011507479861) internal successors, (3078), 2196 states have internal predecessors, (3078), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:03:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 3096 transitions. [2024-11-08 17:03:19,364 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 3096 transitions. Word has length 63 [2024-11-08 17:03:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:19,365 INFO L471 AbstractCegarLoop]: Abstraction has 2207 states and 3096 transitions. [2024-11-08 17:03:19,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-11-08 17:03:19,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 3096 transitions. [2024-11-08 17:03:19,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 17:03:19,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:19,384 INFO L215 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] [2024-11-08 17:03:19,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:03:19,385 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:19,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:19,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1385985353, now seen corresponding path program 1 times [2024-11-08 17:03:19,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:19,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753090200] [2024-11-08 17:03:19,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:19,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:19,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753090200] [2024-11-08 17:03:19,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753090200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:19,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:19,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:03:19,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41442116] [2024-11-08 17:03:19,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:19,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:03:19,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:19,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:03:19,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:03:19,528 INFO L87 Difference]: Start difference. First operand 2207 states and 3096 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-11-08 17:03:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:19,578 INFO L93 Difference]: Finished difference Result 1975 states and 2691 transitions. [2024-11-08 17:03:19,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:03:19,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 71 [2024-11-08 17:03:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:19,586 INFO L225 Difference]: With dead ends: 1975 [2024-11-08 17:03:19,586 INFO L226 Difference]: Without dead ends: 1975 [2024-11-08 17:03:19,586 INFO L431 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-11-08 17:03:19,587 INFO L432 NwaCegarLoop]: 1351 mSDtfsCounter, 75 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 2674 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:19,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 2674 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:03:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2024-11-08 17:03:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1975. [2024-11-08 17:03:19,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1506 states have (on average 1.7749003984063745) internal successors, (2673), 1964 states have internal predecessors, (2673), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:03:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2691 transitions. [2024-11-08 17:03:19,624 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2691 transitions. Word has length 71 [2024-11-08 17:03:19,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:19,624 INFO L471 AbstractCegarLoop]: Abstraction has 1975 states and 2691 transitions. [2024-11-08 17:03:19,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-11-08 17:03:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2691 transitions. [2024-11-08 17:03:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 17:03:19,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:19,626 INFO L215 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-11-08 17:03:19,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:03:19,626 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:19,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:19,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1818784399, now seen corresponding path program 1 times [2024-11-08 17:03:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:19,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204557757] [2024-11-08 17:03:19,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:19,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:20,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:20,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204557757] [2024-11-08 17:03:20,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204557757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:20,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:20,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:03:20,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822188989] [2024-11-08 17:03:20,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:20,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:03:20,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:20,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:03:20,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:03:20,285 INFO L87 Difference]: Start difference. First operand 1975 states and 2691 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 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-11-08 17:03:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:21,717 INFO L93 Difference]: Finished difference Result 1891 states and 2566 transitions. [2024-11-08 17:03:21,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:03:21,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 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-11-08 17:03:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:21,724 INFO L225 Difference]: With dead ends: 1891 [2024-11-08 17:03:21,724 INFO L226 Difference]: Without dead ends: 1891 [2024-11-08 17:03:21,725 INFO L431 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-11-08 17:03:21,725 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 2312 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2318 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:21,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2318 Valid, 1144 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 17:03:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2024-11-08 17:03:21,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1617. [2024-11-08 17:03:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1232 states have (on average 1.6737012987012987) internal successors, (2062), 1606 states have internal predecessors, (2062), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:03:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2080 transitions. [2024-11-08 17:03:21,761 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2080 transitions. Word has length 74 [2024-11-08 17:03:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:21,761 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2080 transitions. [2024-11-08 17:03:21,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 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-11-08 17:03:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2080 transitions. [2024-11-08 17:03:21,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 17:03:21,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:21,763 INFO L215 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] [2024-11-08 17:03:21,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:03:21,763 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:21,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1326524278, now seen corresponding path program 1 times [2024-11-08 17:03:21,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:21,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905880810] [2024-11-08 17:03:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:21,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:22,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:22,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905880810] [2024-11-08 17:03:22,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905880810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:22,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:22,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:03:22,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332288488] [2024-11-08 17:03:22,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:22,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:03:22,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:22,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:03:22,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:03:22,087 INFO L87 Difference]: Start difference. First operand 1617 states and 2080 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 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-11-08 17:03:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:23,176 INFO L93 Difference]: Finished difference Result 1616 states and 2078 transitions. [2024-11-08 17:03:23,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:03:23,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 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 79 [2024-11-08 17:03:23,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:23,182 INFO L225 Difference]: With dead ends: 1616 [2024-11-08 17:03:23,182 INFO L226 Difference]: Without dead ends: 1616 [2024-11-08 17:03:23,182 INFO L431 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-11-08 17:03:23,183 INFO L432 NwaCegarLoop]: 1263 mSDtfsCounter, 2 mSDsluCounter, 2306 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:23,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3569 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:03:23,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2024-11-08 17:03:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1616. [2024-11-08 17:03:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1232 states have (on average 1.672077922077922) internal successors, (2060), 1605 states have internal predecessors, (2060), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:03:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2078 transitions. [2024-11-08 17:03:23,215 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2078 transitions. Word has length 79 [2024-11-08 17:03:23,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:23,215 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2078 transitions. [2024-11-08 17:03:23,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 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-11-08 17:03:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2078 transitions. [2024-11-08 17:03:23,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 17:03:23,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:23,217 INFO L215 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] [2024-11-08 17:03:23,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:03:23,217 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:23,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:23,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1326524277, now seen corresponding path program 1 times [2024-11-08 17:03:23,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:23,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113847244] [2024-11-08 17:03:23,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:23,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:23,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:23,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113847244] [2024-11-08 17:03:23,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113847244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:23,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:23,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:03:23,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430853190] [2024-11-08 17:03:23,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:23,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:03:23,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:23,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:03:23,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:03:23,862 INFO L87 Difference]: Start difference. First operand 1616 states and 2078 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 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-11-08 17:03:25,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:25,164 INFO L93 Difference]: Finished difference Result 1615 states and 2076 transitions. [2024-11-08 17:03:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:03:25,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 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 79 [2024-11-08 17:03:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:25,170 INFO L225 Difference]: With dead ends: 1615 [2024-11-08 17:03:25,170 INFO L226 Difference]: Without dead ends: 1615 [2024-11-08 17:03:25,171 INFO L431 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-11-08 17:03:25,171 INFO L432 NwaCegarLoop]: 1263 mSDtfsCounter, 1 mSDsluCounter, 2321 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3584 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:25,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3584 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:03:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2024-11-08 17:03:25,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1615. [2024-11-08 17:03:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1230 states have (on average 1.673170731707317) internal successors, (2058), 1604 states have internal predecessors, (2058), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:03:25,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2076 transitions. [2024-11-08 17:03:25,200 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2076 transitions. Word has length 79 [2024-11-08 17:03:25,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:25,200 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2076 transitions. [2024-11-08 17:03:25,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 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-11-08 17:03:25,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2076 transitions. [2024-11-08 17:03:25,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 17:03:25,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:25,202 INFO L215 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] [2024-11-08 17:03:25,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:03:25,202 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:25,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:25,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1874297167, now seen corresponding path program 1 times [2024-11-08 17:03:25,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:25,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098055778] [2024-11-08 17:03:25,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:25,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:25,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:03:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:25,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:25,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098055778] [2024-11-08 17:03:25,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098055778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:25,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:25,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:03:25,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018241988] [2024-11-08 17:03:25,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:25,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:03:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:25,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:03:25,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:03:25,535 INFO L87 Difference]: Start difference. First operand 1615 states and 2076 transitions. Second operand has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 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-11-08 17:03:27,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:27,172 INFO L93 Difference]: Finished difference Result 1633 states and 2106 transitions. [2024-11-08 17:03:27,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:03:27,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 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 87 [2024-11-08 17:03:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:27,179 INFO L225 Difference]: With dead ends: 1633 [2024-11-08 17:03:27,180 INFO L226 Difference]: Without dead ends: 1633 [2024-11-08 17:03:27,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:03:27,180 INFO L432 NwaCegarLoop]: 1252 mSDtfsCounter, 10 mSDsluCounter, 4284 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5536 SdHoareTripleChecker+Invalid, 2056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:27,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5536 Invalid, 2056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 17:03:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2024-11-08 17:03:27,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1624. [2024-11-08 17:03:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1238 states have (on average 1.6712439418416802) internal successors, (2069), 1611 states have internal predecessors, (2069), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-08 17:03:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2096 transitions. [2024-11-08 17:03:27,224 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2096 transitions. Word has length 87 [2024-11-08 17:03:27,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:27,225 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2096 transitions. [2024-11-08 17:03:27,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 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-11-08 17:03:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2096 transitions. [2024-11-08 17:03:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 17:03:27,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:27,226 INFO L215 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] [2024-11-08 17:03:27,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:03:27,226 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:27,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:27,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1874297166, now seen corresponding path program 1 times [2024-11-08 17:03:27,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:27,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688448006] [2024-11-08 17:03:27,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:27,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:27,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:03:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:27,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:27,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688448006] [2024-11-08 17:03:27,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688448006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:27,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:27,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:03:27,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080697726] [2024-11-08 17:03:27,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:27,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:03:27,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:27,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:03:27,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:03:27,909 INFO L87 Difference]: Start difference. First operand 1624 states and 2096 transitions. Second operand has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-11-08 17:03:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:29,538 INFO L93 Difference]: Finished difference Result 1624 states and 2094 transitions. [2024-11-08 17:03:29,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:03:29,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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 87 [2024-11-08 17:03:29,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:29,557 INFO L225 Difference]: With dead ends: 1624 [2024-11-08 17:03:29,557 INFO L226 Difference]: Without dead ends: 1624 [2024-11-08 17:03:29,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:03:29,562 INFO L432 NwaCegarLoop]: 1259 mSDtfsCounter, 5 mSDsluCounter, 3371 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4630 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:29,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4630 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1686 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 17:03:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2024-11-08 17:03:29,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1624. [2024-11-08 17:03:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1238 states have (on average 1.6696284329563813) internal successors, (2067), 1611 states have internal predecessors, (2067), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-08 17:03:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2094 transitions. [2024-11-08 17:03:29,608 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2094 transitions. Word has length 87 [2024-11-08 17:03:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:29,608 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2094 transitions. [2024-11-08 17:03:29,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-11-08 17:03:29,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2094 transitions. [2024-11-08 17:03:29,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 17:03:29,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:29,610 INFO L215 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] [2024-11-08 17:03:29,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:03:29,610 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:29,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:29,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2057122848, now seen corresponding path program 1 times [2024-11-08 17:03:29,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:29,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872147978] [2024-11-08 17:03:29,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:29,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:30,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:03:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:30,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:30,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872147978] [2024-11-08 17:03:30,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872147978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:03:30,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331132405] [2024-11-08 17:03:30,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:30,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:30,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:30,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:30,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:03:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:30,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 17:03:30,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:30,630 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-11-08 17:03:30,801 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:03:30,801 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-11-08 17:03:30,818 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-11-08 17:03:30,932 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:03:30,932 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-11-08 17:03:30,975 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-11-08 17:03:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:30,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:03:31,036 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-08 17:03:31,036 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-11-08 17:03:31,045 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_493 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-08 17:03:31,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331132405] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:03:31,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:03:31,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-08 17:03:31,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884411833] [2024-11-08 17:03:31,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:03:31,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 17:03:31,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:31,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 17:03:31,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2024-11-08 17:03:31,050 INFO L87 Difference]: Start difference. First operand 1624 states and 2094 transitions. Second operand has 15 states, 13 states have (on average 9.692307692307692) internal successors, (126), 13 states have internal predecessors, (126), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 17:03:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:34,032 INFO L93 Difference]: Finished difference Result 1623 states and 2092 transitions. [2024-11-08 17:03:34,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:03:34,033 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.692307692307692) internal successors, (126), 13 states have internal predecessors, (126), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2024-11-08 17:03:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:34,042 INFO L225 Difference]: With dead ends: 1623 [2024-11-08 17:03:34,042 INFO L226 Difference]: Without dead ends: 1623 [2024-11-08 17:03:34,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=419, Unknown=1, NotChecked=42, Total=552 [2024-11-08 17:03:34,043 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 1224 mSDsluCounter, 6010 mSDsCounter, 0 mSdLazyCounter, 4578 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 6783 SdHoareTripleChecker+Invalid, 4604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:34,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 6783 Invalid, 4604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 4578 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 17:03:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2024-11-08 17:03:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1623. [2024-11-08 17:03:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1238 states have (on average 1.6680129240710824) internal successors, (2065), 1610 states have internal predecessors, (2065), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-08 17:03:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2092 transitions. [2024-11-08 17:03:34,073 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2092 transitions. Word has length 88 [2024-11-08 17:03:34,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:34,074 INFO L471 AbstractCegarLoop]: Abstraction has 1623 states and 2092 transitions. [2024-11-08 17:03:34,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.692307692307692) internal successors, (126), 13 states have internal predecessors, (126), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 17:03:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2092 transitions. [2024-11-08 17:03:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 17:03:34,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:34,075 INFO L215 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] [2024-11-08 17:03:34,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:03:34,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 17:03:34,280 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:34,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2057122847, now seen corresponding path program 1 times [2024-11-08 17:03:34,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:34,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608769885] [2024-11-08 17:03:34,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:34,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:35,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:03:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:35,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:35,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608769885] [2024-11-08 17:03:35,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608769885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:03:35,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633300554] [2024-11-08 17:03:35,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:35,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:35,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:35,223 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:35,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:03:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:35,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 17:03:35,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:35,494 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-11-08 17:03:35,642 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:03:35,643 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-11-08 17:03:35,681 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-11-08 17:03:35,686 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-11-08 17:03:35,909 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:03:35,909 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-11-08 17:03:35,920 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-11-08 17:03:35,976 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-11-08 17:03:35,983 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-11-08 17:03:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:36,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:03:36,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:03:36,172 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-11-08 17:03:36,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_628 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_628) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_prenex_1 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_1) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem50#1.offset| 25))) (forall ((v_ArrVal_627 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_627) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem50#1.base|)))) is different from false [2024-11-08 17:03:36,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633300554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:03:36,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:03:36,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2024-11-08 17:03:36,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152374177] [2024-11-08 17:03:36,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:03:36,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 17:03:36,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:36,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 17:03:36,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=399, Unknown=1, NotChecked=40, Total=506 [2024-11-08 17:03:36,239 INFO L87 Difference]: Start difference. First operand 1623 states and 2092 transitions. Second operand has 20 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 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-11-08 17:03:39,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:39,461 INFO L93 Difference]: Finished difference Result 1622 states and 2090 transitions. [2024-11-08 17:03:39,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:03:39,462 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 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 88 [2024-11-08 17:03:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:39,466 INFO L225 Difference]: With dead ends: 1622 [2024-11-08 17:03:39,466 INFO L226 Difference]: Without dead ends: 1622 [2024-11-08 17:03:39,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=596, Unknown=1, NotChecked=50, Total=756 [2024-11-08 17:03:39,467 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 1201 mSDsluCounter, 5607 mSDsCounter, 0 mSdLazyCounter, 4900 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 6379 SdHoareTripleChecker+Invalid, 4930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:39,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 6379 Invalid, 4930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4900 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 17:03:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2024-11-08 17:03:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1613. [2024-11-08 17:03:39,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1230 states have (on average 1.6699186991869919) internal successors, (2054), 1602 states have internal predecessors, (2054), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:03:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2072 transitions. [2024-11-08 17:03:39,495 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2072 transitions. Word has length 88 [2024-11-08 17:03:39,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:39,496 INFO L471 AbstractCegarLoop]: Abstraction has 1613 states and 2072 transitions. [2024-11-08 17:03:39,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 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-11-08 17:03:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2072 transitions. [2024-11-08 17:03:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 17:03:39,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:39,497 INFO L215 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-11-08 17:03:39,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 17:03:39,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 17:03:39,698 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:39,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:39,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1683520950, now seen corresponding path program 1 times [2024-11-08 17:03:39,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:39,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398307219] [2024-11-08 17:03:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:39,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:40,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:03:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:40,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:40,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398307219] [2024-11-08 17:03:40,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398307219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:40,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:40,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 17:03:40,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182448903] [2024-11-08 17:03:40,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:40,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:03:40,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:40,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:03:40,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:03:40,335 INFO L87 Difference]: Start difference. First operand 1613 states and 2072 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 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-11-08 17:03:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:43,079 INFO L93 Difference]: Finished difference Result 1629 states and 2098 transitions. [2024-11-08 17:03:43,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:03:43,080 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 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-11-08 17:03:43,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:43,084 INFO L225 Difference]: With dead ends: 1629 [2024-11-08 17:03:43,084 INFO L226 Difference]: Without dead ends: 1629 [2024-11-08 17:03:43,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:03:43,085 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 1253 mSDsluCounter, 6001 mSDsCounter, 0 mSdLazyCounter, 4596 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 6773 SdHoareTripleChecker+Invalid, 4617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:43,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 6773 Invalid, 4617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4596 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 17:03:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2024-11-08 17:03:43,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1628. [2024-11-08 17:03:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1244 states have (on average 1.664790996784566) internal successors, (2071), 1615 states have internal predecessors, (2071), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-08 17:03:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2098 transitions. [2024-11-08 17:03:43,133 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2098 transitions. Word has length 90 [2024-11-08 17:03:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:43,134 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 2098 transitions. [2024-11-08 17:03:43,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 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-11-08 17:03:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2098 transitions. [2024-11-08 17:03:43,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 17:03:43,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:43,136 INFO L215 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-11-08 17:03:43,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:03:43,137 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:43,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:43,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1683520951, now seen corresponding path program 1 times [2024-11-08 17:03:43,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:43,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99125820] [2024-11-08 17:03:43,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:43,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:44,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:03:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:44,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:44,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99125820] [2024-11-08 17:03:44,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99125820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:44,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:44,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 17:03:44,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671965600] [2024-11-08 17:03:44,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:44,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:03:44,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:44,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:03:44,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:03:44,089 INFO L87 Difference]: Start difference. First operand 1628 states and 2098 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 11 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-11-08 17:03:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:46,737 INFO L93 Difference]: Finished difference Result 1628 states and 2096 transitions. [2024-11-08 17:03:46,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:03:46,738 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 11 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-11-08 17:03:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:46,741 INFO L225 Difference]: With dead ends: 1628 [2024-11-08 17:03:46,741 INFO L226 Difference]: Without dead ends: 1628 [2024-11-08 17:03:46,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:03:46,742 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 1246 mSDsluCounter, 3983 mSDsCounter, 0 mSdLazyCounter, 4069 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 4762 SdHoareTripleChecker+Invalid, 4088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:46,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 4762 Invalid, 4088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4069 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 17:03:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2024-11-08 17:03:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1628. [2024-11-08 17:03:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1244 states have (on average 1.6631832797427653) internal successors, (2069), 1615 states have internal predecessors, (2069), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-08 17:03:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2096 transitions. [2024-11-08 17:03:46,764 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2096 transitions. Word has length 90 [2024-11-08 17:03:46,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:46,764 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 2096 transitions. [2024-11-08 17:03:46,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 11 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-11-08 17:03:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2096 transitions. [2024-11-08 17:03:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 17:03:46,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:46,766 INFO L215 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-11-08 17:03:46,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 17:03:46,766 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:46,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:46,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1142189607, now seen corresponding path program 1 times [2024-11-08 17:03:46,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:46,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337944402] [2024-11-08 17:03:46,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:46,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:47,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:03:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:47,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:47,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337944402] [2024-11-08 17:03:47,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337944402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:03:47,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135436406] [2024-11-08 17:03:47,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:47,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:47,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:47,389 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:47,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:03:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:47,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 17:03:47,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:47,690 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-11-08 17:03:47,806 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:03:47,807 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-11-08 17:03:47,816 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-11-08 17:03:47,915 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:03:47,915 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-11-08 17:03:47,991 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:03:47,992 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-11-08 17:03:48,006 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-11-08 17:03:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:48,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:03:48,024 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_883) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-08 17:03:48,032 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (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_883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-08 17:03:48,091 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-08 17:03:48,092 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-11-08 17:03:48,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135436406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:03:48,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:03:48,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2024-11-08 17:03:48,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125678380] [2024-11-08 17:03:48,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:03:48,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:03:48,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:48,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:03:48,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=280, Unknown=13, NotChecked=70, Total=420 [2024-11-08 17:03:48,154 INFO L87 Difference]: Start difference. First operand 1628 states and 2096 transitions. Second operand has 18 states, 16 states have (on average 8.5) internal successors, (136), 17 states have internal predecessors, (136), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 17:03:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:50,278 INFO L93 Difference]: Finished difference Result 1627 states and 2094 transitions. [2024-11-08 17:03:50,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:03:50,278 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.5) internal successors, (136), 17 states have internal predecessors, (136), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2024-11-08 17:03:50,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:50,282 INFO L225 Difference]: With dead ends: 1627 [2024-11-08 17:03:50,282 INFO L226 Difference]: Without dead ends: 1627 [2024-11-08 17:03:50,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=580, Unknown=14, NotChecked=102, Total=812 [2024-11-08 17:03:50,283 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 1222 mSDsluCounter, 4497 mSDsCounter, 0 mSdLazyCounter, 3571 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 5269 SdHoareTripleChecker+Invalid, 3602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:50,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1232 Valid, 5269 Invalid, 3602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3571 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 17:03:50,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2024-11-08 17:03:50,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1627. [2024-11-08 17:03:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1244 states have (on average 1.6615755627009647) internal successors, (2067), 1614 states have internal predecessors, (2067), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-08 17:03:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2094 transitions. [2024-11-08 17:03:50,308 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2094 transitions. Word has length 91 [2024-11-08 17:03:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:50,308 INFO L471 AbstractCegarLoop]: Abstraction has 1627 states and 2094 transitions. [2024-11-08 17:03:50,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.5) internal successors, (136), 17 states have internal predecessors, (136), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 17:03:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2094 transitions. [2024-11-08 17:03:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 17:03:50,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:50,310 INFO L215 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-11-08 17:03:50,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 17:03:50,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:50,514 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:50,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:50,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1142189608, now seen corresponding path program 1 times [2024-11-08 17:03:50,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:50,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619719965] [2024-11-08 17:03:50,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:50,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:51,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:03:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:51,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:51,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619719965] [2024-11-08 17:03:51,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619719965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:03:51,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292615985] [2024-11-08 17:03:51,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:51,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:51,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:51,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:51,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 17:03:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:51,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 17:03:51,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:51,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 17:03:51,988 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:03:51,988 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-11-08 17:03:51,994 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-11-08 17:03:52,003 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-11-08 17:03:52,007 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-11-08 17:03:52,068 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-11-08 17:03:52,073 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-11-08 17:03:52,196 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:03:52,197 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-11-08 17:03:52,202 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-11-08 17:03:52,288 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:03:52,288 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-11-08 17:03:52,293 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-11-08 17:03:52,316 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-11-08 17:03:52,321 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-11-08 17:03:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:52,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:03:52,406 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1029 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1029) |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~mem52#1.base| v_ArrVal_1030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 17:03:52,421 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_1029 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-08 17:03:52,484 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1035 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1035) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1036))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1035) .cse1 v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-08 17:03:52,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292615985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:03:52,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:03:52,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 16 [2024-11-08 17:03:52,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116374581] [2024-11-08 17:03:52,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:03:52,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 17:03:52,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:52,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 17:03:52,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=293, Unknown=3, NotChecked=108, Total=462 [2024-11-08 17:03:52,488 INFO L87 Difference]: Start difference. First operand 1627 states and 2094 transitions. Second operand has 17 states, 15 states have (on average 9.0) internal successors, (135), 16 states have internal predecessors, (135), 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-11-08 17:03:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:57,951 INFO L93 Difference]: Finished difference Result 1634 states and 2100 transitions. [2024-11-08 17:03:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:03:57,953 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 9.0) internal successors, (135), 16 states have internal predecessors, (135), 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 91 [2024-11-08 17:03:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:57,956 INFO L225 Difference]: With dead ends: 1634 [2024-11-08 17:03:57,956 INFO L226 Difference]: Without dead ends: 1634 [2024-11-08 17:03:57,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=599, Unknown=3, NotChecked=156, Total=870 [2024-11-08 17:03:57,957 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 1201 mSDsluCounter, 6766 mSDsCounter, 0 mSdLazyCounter, 7513 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 7536 SdHoareTripleChecker+Invalid, 7537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:57,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 7536 Invalid, 7537 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 7513 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-08 17:03:57,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-08 17:03:57,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1616. [2024-11-08 17:03:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1234 states have (on average 1.6653160453808753) internal successors, (2055), 1604 states have internal predecessors, (2055), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:03:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2073 transitions. [2024-11-08 17:03:57,978 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2073 transitions. Word has length 91 [2024-11-08 17:03:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:57,979 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2073 transitions. [2024-11-08 17:03:57,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 9.0) internal successors, (135), 16 states have internal predecessors, (135), 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-11-08 17:03:57,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2073 transitions. [2024-11-08 17:03:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 17:03:57,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:57,980 INFO L215 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-11-08 17:03:58,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 17:03:58,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:58,181 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:03:58,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1440120760, now seen corresponding path program 1 times [2024-11-08 17:03:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:03:58,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910450225] [2024-11-08 17:03:58,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:58,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:03:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:58,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:03:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:58,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:03:58,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910450225] [2024-11-08 17:03:58,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910450225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:58,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:58,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:03:58,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39445382] [2024-11-08 17:03:58,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:58,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 17:03:58,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:03:58,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 17:03:58,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:03:58,946 INFO L87 Difference]: Start difference. First operand 1616 states and 2073 transitions. Second operand has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 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-11-08 17:04:02,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:04:02,022 INFO L93 Difference]: Finished difference Result 1641 states and 2108 transitions. [2024-11-08 17:04:02,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:04:02,022 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 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-11-08 17:04:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:04:02,026 INFO L225 Difference]: With dead ends: 1641 [2024-11-08 17:04:02,026 INFO L226 Difference]: Without dead ends: 1641 [2024-11-08 17:04:02,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-08 17:04:02,027 INFO L432 NwaCegarLoop]: 771 mSDtfsCounter, 1188 mSDsluCounter, 6706 mSDsCounter, 0 mSdLazyCounter, 5108 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 7477 SdHoareTripleChecker+Invalid, 5128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:04:02,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 7477 Invalid, 5128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5108 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 17:04:02,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2024-11-08 17:04:02,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1637. [2024-11-08 17:04:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1637 states, 1254 states have (on average 1.657097288676236) internal successors, (2078), 1623 states have internal predecessors, (2078), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 17:04:02,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2098 transitions. [2024-11-08 17:04:02,061 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2098 transitions. Word has length 93 [2024-11-08 17:04:02,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:04:02,062 INFO L471 AbstractCegarLoop]: Abstraction has 1637 states and 2098 transitions. [2024-11-08 17:04:02,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 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-11-08 17:04:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2098 transitions. [2024-11-08 17:04:02,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 17:04:02,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:04:02,063 INFO L215 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-11-08 17:04:02,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 17:04:02,064 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:04:02,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:04:02,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1440120761, now seen corresponding path program 1 times [2024-11-08 17:04:02,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:04:02,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936873768] [2024-11-08 17:04:02,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:02,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:04:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:03,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:04:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:04:03,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:04:03,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936873768] [2024-11-08 17:04:03,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936873768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:04:03,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:04:03,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 17:04:03,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743475412] [2024-11-08 17:04:03,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:04:03,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:04:03,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:04:03,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:04:03,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:04:03,199 INFO L87 Difference]: Start difference. First operand 1637 states and 2098 transitions. Second operand has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 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-11-08 17:04:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:04:06,646 INFO L93 Difference]: Finished difference Result 1640 states and 2106 transitions. [2024-11-08 17:04:06,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:04:06,647 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 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-11-08 17:04:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:04:06,650 INFO L225 Difference]: With dead ends: 1640 [2024-11-08 17:04:06,651 INFO L226 Difference]: Without dead ends: 1640 [2024-11-08 17:04:06,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:04:06,652 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 1207 mSDsluCounter, 5124 mSDsCounter, 0 mSdLazyCounter, 5441 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 5902 SdHoareTripleChecker+Invalid, 5460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 5441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:04:06,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 5902 Invalid, 5460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 5441 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 17:04:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-08 17:04:06,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1637. [2024-11-08 17:04:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1637 states, 1254 states have (on average 1.6555023923444976) internal successors, (2076), 1623 states have internal predecessors, (2076), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 17:04:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2096 transitions. [2024-11-08 17:04:06,674 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2096 transitions. Word has length 93 [2024-11-08 17:04:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:04:06,674 INFO L471 AbstractCegarLoop]: Abstraction has 1637 states and 2096 transitions. [2024-11-08 17:04:06,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 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-11-08 17:04:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2096 transitions. [2024-11-08 17:04:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:04:06,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:04:06,676 INFO L215 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-11-08 17:04:06,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 17:04:06,676 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:04:06,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:04:06,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2054689369, now seen corresponding path program 1 times [2024-11-08 17:04:06,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:04:06,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496636523] [2024-11-08 17:04:06,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:06,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:04:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:07,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:04:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:04:07,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:04:07,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496636523] [2024-11-08 17:04:07,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496636523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:04:07,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082817701] [2024-11-08 17:04:07,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:07,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:04:07,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:04:07,412 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:04:07,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 17:04:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:07,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 17:04:07,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:04:07,706 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-11-08 17:04:07,818 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:04:07,818 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-11-08 17:04:07,828 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-11-08 17:04:07,907 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:07,907 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-11-08 17:04:07,953 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:07,953 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-11-08 17:04:08,004 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:08,004 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-11-08 17:04:08,018 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-11-08 17:04:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:04:08,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:04:08,034 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1316) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-08 17:04:08,082 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1315 (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~mem52#1.base| v_ArrVal_1315))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 17:04:08,088 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1315 (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_1315))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 17:04:08,131 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-08 17:04:08,132 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-11-08 17:04:08,141 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1319 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (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~mem50#1.base| v_ArrVal_1319))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1315)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-08 17:04:08,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082817701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:04:08,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:04:08,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 19 [2024-11-08 17:04:08,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040053994] [2024-11-08 17:04:08,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:04:08,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 17:04:08,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:04:08,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 17:04:08,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=353, Unknown=11, NotChecked=164, Total=600 [2024-11-08 17:04:08,145 INFO L87 Difference]: Start difference. First operand 1637 states and 2096 transitions. Second operand has 20 states, 18 states have (on average 7.833333333333333) internal successors, (141), 19 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 17:04:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:04:11,479 INFO L93 Difference]: Finished difference Result 1639 states and 2104 transitions. [2024-11-08 17:04:11,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:04:11,480 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.833333333333333) internal successors, (141), 19 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2024-11-08 17:04:11,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:04:11,483 INFO L225 Difference]: With dead ends: 1639 [2024-11-08 17:04:11,483 INFO L226 Difference]: Without dead ends: 1639 [2024-11-08 17:04:11,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=731, Unknown=11, NotChecked=236, Total=1122 [2024-11-08 17:04:11,484 INFO L432 NwaCegarLoop]: 771 mSDtfsCounter, 1216 mSDsluCounter, 8245 mSDsCounter, 0 mSdLazyCounter, 6080 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 9016 SdHoareTripleChecker+Invalid, 6105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:04:11,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 9016 Invalid, 6105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 6080 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 17:04:11,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2024-11-08 17:04:11,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1636. [2024-11-08 17:04:11,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1254 states have (on average 1.653907496012759) internal successors, (2074), 1622 states have internal predecessors, (2074), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 17:04:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2094 transitions. [2024-11-08 17:04:11,506 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2094 transitions. Word has length 94 [2024-11-08 17:04:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:04:11,507 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2094 transitions. [2024-11-08 17:04:11,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.833333333333333) internal successors, (141), 19 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 17:04:11,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2094 transitions. [2024-11-08 17:04:11,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:04:11,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:04:11,508 INFO L215 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-11-08 17:04:11,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 17:04:11,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-08 17:04:11,709 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:04:11,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:04:11,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2054689368, now seen corresponding path program 1 times [2024-11-08 17:04:11,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:04:11,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991150940] [2024-11-08 17:04:11,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:11,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:04:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:12,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:04:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:04:12,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:04:12,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991150940] [2024-11-08 17:04:12,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991150940] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:04:12,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628136877] [2024-11-08 17:04:12,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:12,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:04:12,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:04:12,812 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:04:12,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 17:04:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:13,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-08 17:04:13,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:04:13,115 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-11-08 17:04:13,230 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-11-08 17:04:13,243 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:04:13,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 17:04:13,274 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-11-08 17:04:13,280 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-11-08 17:04:13,377 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-11-08 17:04:13,381 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-11-08 17:04:13,495 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:13,495 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-11-08 17:04:13,502 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-11-08 17:04:13,590 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:13,590 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-11-08 17:04:13,597 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-11-08 17:04:13,674 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:13,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 62 treesize of output 57 [2024-11-08 17:04:13,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-11-08 17:04:13,703 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-11-08 17:04:13,709 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-11-08 17:04:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:04:13,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:04:14,005 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1474))) (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~mem52#1.base| v_ArrVal_1475) .cse0 v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1475) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1474) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-08 17:04:14,023 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_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1475) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1474) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1474))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1475) .cse2 v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-08 17:04:14,083 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1482))) (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~mem50#1.base| v_ArrVal_1483) .cse0 v_ArrVal_1475) (select (select (store .cse1 .cse0 v_ArrVal_1474) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1477))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1482))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1474))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1483) .cse3 v_ArrVal_1475) .cse4 v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-08 17:04:14,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628136877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:04:14,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:04:14,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2024-11-08 17:04:14,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349170435] [2024-11-08 17:04:14,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:04:14,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 17:04:14,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:04:14,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 17:04:14,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=584, Unknown=29, NotChecked=156, Total=870 [2024-11-08 17:04:14,088 INFO L87 Difference]: Start difference. First operand 1636 states and 2094 transitions. Second operand has 23 states, 20 states have (on average 7.45) internal successors, (149), 22 states have internal predecessors, (149), 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-11-08 17:04:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:04:20,714 INFO L93 Difference]: Finished difference Result 1638 states and 2102 transitions. [2024-11-08 17:04:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:04:20,715 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.45) internal successors, (149), 22 states have internal predecessors, (149), 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 94 [2024-11-08 17:04:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:04:20,719 INFO L225 Difference]: With dead ends: 1638 [2024-11-08 17:04:20,719 INFO L226 Difference]: Without dead ends: 1638 [2024-11-08 17:04:20,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=937, Unknown=30, NotChecked=198, Total=1332 [2024-11-08 17:04:20,720 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 1176 mSDsluCounter, 10026 mSDsCounter, 0 mSdLazyCounter, 10535 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 10802 SdHoareTripleChecker+Invalid, 10558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 10535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:04:20,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 10802 Invalid, 10558 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 10535 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-08 17:04:20,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2024-11-08 17:04:20,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1614. [2024-11-08 17:04:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1234 states have (on average 1.6620745542949757) internal successors, (2051), 1602 states have internal predecessors, (2051), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:04:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2069 transitions. [2024-11-08 17:04:20,745 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2069 transitions. Word has length 94 [2024-11-08 17:04:20,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:04:20,745 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2069 transitions. [2024-11-08 17:04:20,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.45) internal successors, (149), 22 states have internal predecessors, (149), 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-11-08 17:04:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2069 transitions. [2024-11-08 17:04:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 17:04:20,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:04:20,747 INFO L215 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-11-08 17:04:20,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 17:04:20,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:04:20,951 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:04:20,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:04:20,952 INFO L85 PathProgramCache]: Analyzing trace with hash 209863069, now seen corresponding path program 1 times [2024-11-08 17:04:20,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:04:20,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818978444] [2024-11-08 17:04:20,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:20,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:04:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:21,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:04:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:04:21,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:04:21,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818978444] [2024-11-08 17:04:21,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818978444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:04:21,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:04:21,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 17:04:21,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387063583] [2024-11-08 17:04:21,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:04:21,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:04:21,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:04:21,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:04:21,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:04:21,913 INFO L87 Difference]: Start difference. First operand 1614 states and 2069 transitions. Second operand has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 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-11-08 17:04:24,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:04:24,439 INFO L93 Difference]: Finished difference Result 1645 states and 2110 transitions. [2024-11-08 17:04:24,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:04:24,439 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 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-11-08 17:04:24,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:04:24,443 INFO L225 Difference]: With dead ends: 1645 [2024-11-08 17:04:24,443 INFO L226 Difference]: Without dead ends: 1645 [2024-11-08 17:04:24,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-08 17:04:24,444 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 1251 mSDsluCounter, 5251 mSDsCounter, 0 mSdLazyCounter, 4092 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 6021 SdHoareTripleChecker+Invalid, 4112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:04:24,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 6021 Invalid, 4112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4092 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 17:04:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2024-11-08 17:04:24,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1641. [2024-11-08 17:04:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1260 states have (on average 1.6507936507936507) internal successors, (2080), 1627 states have internal predecessors, (2080), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 17:04:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2100 transitions. [2024-11-08 17:04:24,466 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2100 transitions. Word has length 96 [2024-11-08 17:04:24,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:04:24,467 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2100 transitions. [2024-11-08 17:04:24,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 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-11-08 17:04:24,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2100 transitions. [2024-11-08 17:04:24,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 17:04:24,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:04:24,468 INFO L215 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-11-08 17:04:24,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 17:04:24,469 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:04:24,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:04:24,469 INFO L85 PathProgramCache]: Analyzing trace with hash 209863070, now seen corresponding path program 1 times [2024-11-08 17:04:24,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:04:24,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113743788] [2024-11-08 17:04:24,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:24,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:04:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:25,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:04:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:04:25,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:04:25,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113743788] [2024-11-08 17:04:25,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113743788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:04:25,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:04:25,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 17:04:25,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144321948] [2024-11-08 17:04:25,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:04:25,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:04:25,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:04:25,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:04:25,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:04:25,593 INFO L87 Difference]: Start difference. First operand 1641 states and 2100 transitions. Second operand has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 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-11-08 17:04:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:04:29,382 INFO L93 Difference]: Finished difference Result 1644 states and 2108 transitions. [2024-11-08 17:04:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:04:29,383 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 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-11-08 17:04:29,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:04:29,386 INFO L225 Difference]: With dead ends: 1644 [2024-11-08 17:04:29,386 INFO L226 Difference]: Without dead ends: 1644 [2024-11-08 17:04:29,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:04:29,387 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 1187 mSDsluCounter, 5640 mSDsCounter, 0 mSdLazyCounter, 6130 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 6417 SdHoareTripleChecker+Invalid, 6154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:04:29,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 6417 Invalid, 6154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6130 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 17:04:29,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2024-11-08 17:04:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1641. [2024-11-08 17:04:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1260 states have (on average 1.6492063492063491) internal successors, (2078), 1627 states have internal predecessors, (2078), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 17:04:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2098 transitions. [2024-11-08 17:04:29,408 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2098 transitions. Word has length 96 [2024-11-08 17:04:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:04:29,408 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2098 transitions. [2024-11-08 17:04:29,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 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-11-08 17:04:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2098 transitions. [2024-11-08 17:04:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 17:04:29,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:04:29,410 INFO L215 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-11-08 17:04:29,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 17:04:29,410 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:04:29,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:04:29,411 INFO L85 PathProgramCache]: Analyzing trace with hash 623532366, now seen corresponding path program 1 times [2024-11-08 17:04:29,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:04:29,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124399502] [2024-11-08 17:04:29,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:29,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:04:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:30,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:04:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:04:30,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:04:30,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124399502] [2024-11-08 17:04:30,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124399502] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:04:30,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362774114] [2024-11-08 17:04:30,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:30,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:04:30,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:04:30,219 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:04:30,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 17:04:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:30,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 17:04:30,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:04:30,532 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-11-08 17:04:30,631 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:04:30,631 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-11-08 17:04:30,643 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-11-08 17:04:30,744 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:30,744 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-11-08 17:04:30,801 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:30,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 42 treesize of output 41 [2024-11-08 17:04:30,860 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:30,861 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-11-08 17:04:30,918 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:30,919 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-11-08 17:04:30,932 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-11-08 17:04:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:04:30,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:04:30,947 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1788) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-08 17:04:30,996 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (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_1787))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 17:04:31,004 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (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_1787))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 17:04:31,016 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1786 (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~mem52#1.base| v_ArrVal_1786))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 17:04:31,113 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-08 17:04:31,113 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-11-08 17:04:31,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362774114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:04:31,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:04:31,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 22 [2024-11-08 17:04:31,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307134578] [2024-11-08 17:04:31,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:04:31,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 17:04:31,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:04:31,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 17:04:31,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=544, Unknown=23, NotChecked=204, Total=870 [2024-11-08 17:04:31,186 INFO L87 Difference]: Start difference. First operand 1641 states and 2098 transitions. Second operand has 23 states, 20 states have (on average 7.35) internal successors, (147), 22 states have internal predecessors, (147), 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-11-08 17:04:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:04:34,461 INFO L93 Difference]: Finished difference Result 1643 states and 2106 transitions. [2024-11-08 17:04:34,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:04:34,462 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.35) internal successors, (147), 22 states have internal predecessors, (147), 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-11-08 17:04:34,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:04:34,465 INFO L225 Difference]: With dead ends: 1643 [2024-11-08 17:04:34,465 INFO L226 Difference]: Without dead ends: 1643 [2024-11-08 17:04:34,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=1061, Unknown=23, NotChecked=284, Total=1560 [2024-11-08 17:04:34,466 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 1172 mSDsluCounter, 7453 mSDsCounter, 0 mSdLazyCounter, 5581 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 8223 SdHoareTripleChecker+Invalid, 5603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:04:34,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 8223 Invalid, 5603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 5581 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 17:04:34,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2024-11-08 17:04:34,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1640. [2024-11-08 17:04:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1260 states have (on average 1.6476190476190475) internal successors, (2076), 1626 states have internal predecessors, (2076), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 17:04:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2096 transitions. [2024-11-08 17:04:34,491 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2096 transitions. Word has length 97 [2024-11-08 17:04:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:04:34,491 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2096 transitions. [2024-11-08 17:04:34,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.35) internal successors, (147), 22 states have internal predecessors, (147), 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-11-08 17:04:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2096 transitions. [2024-11-08 17:04:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 17:04:34,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:04:34,493 INFO L215 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-11-08 17:04:34,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 17:04:34,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-08 17:04:34,694 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:04:34,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:04:34,695 INFO L85 PathProgramCache]: Analyzing trace with hash 623532367, now seen corresponding path program 1 times [2024-11-08 17:04:34,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:04:34,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87881099] [2024-11-08 17:04:34,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:34,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:04:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:35,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:04:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:35,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-11-08 17:04:35,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:04:35,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87881099] [2024-11-08 17:04:35,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87881099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:04:35,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398749638] [2024-11-08 17:04:35,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:35,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:04:35,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:04:35,891 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:04:35,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 17:04:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:36,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-08 17:04:36,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:04:36,229 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-11-08 17:04:36,349 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-11-08 17:04:36,357 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:04:36,357 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-11-08 17:04:36,388 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-11-08 17:04:36,394 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-11-08 17:04:36,491 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-11-08 17:04:36,497 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-11-08 17:04:36,613 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:36,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 62 treesize of output 57 [2024-11-08 17:04:36,619 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-11-08 17:04:36,716 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:36,717 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-11-08 17:04:36,723 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-11-08 17:04:36,797 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:36,798 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-11-08 17:04:36,802 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-11-08 17:04:36,876 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:36,876 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-11-08 17:04:36,881 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-11-08 17:04:36,902 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-11-08 17:04:36,909 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-11-08 17:04:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:04:36,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:04:37,094 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_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1962 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-08 17:04:37,116 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1960))) (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_1961) .cse0 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1961) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-08 17:04:37,131 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_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1961) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1960))) (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_1961) .cse2 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-08 17:04:37,162 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1959))) (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~mem52#1.base| v_ArrVal_1958) .cse0 v_ArrVal_1961) (select (select (store .cse1 .cse0 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1962))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1959))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1960))) (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~mem52#1.base| v_ArrVal_1958) .cse3 v_ArrVal_1961) .cse4 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-08 17:04:37,193 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_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1959))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1960))) (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_1958) .cse1 v_ArrVal_1961) .cse2 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1959))) (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_1958) .cse6 v_ArrVal_1961) (select (select (store .cse7 .cse6 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1962))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2024-11-08 17:04:37,276 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1969 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1968 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1969))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1959))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1960))) (let ((.cse2 (select (select .cse4 |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~mem50#1.base| v_ArrVal_1968) .cse0 v_ArrVal_1958) .cse1 v_ArrVal_1961) .cse2 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1969 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1968 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1969))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1959))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1968) .cse7 v_ArrVal_1958) .cse8 v_ArrVal_1961) (select (select (store .cse9 .cse8 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1962))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-08 17:04:37,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398749638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:04:37,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:04:37,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-11-08 17:04:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238490093] [2024-11-08 17:04:37,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:04:37,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 17:04:37,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:04:37,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 17:04:37,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=652, Unknown=20, NotChecked=342, Total=1122 [2024-11-08 17:04:37,282 INFO L87 Difference]: Start difference. First operand 1640 states and 2096 transitions. Second operand has 25 states, 22 states have (on average 7.045454545454546) internal successors, (155), 24 states have internal predecessors, (155), 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-11-08 17:04:44,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:04:44,181 INFO L93 Difference]: Finished difference Result 1642 states and 2104 transitions. [2024-11-08 17:04:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:04:44,182 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.045454545454546) internal successors, (155), 24 states have internal predecessors, (155), 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-11-08 17:04:44,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:04:44,185 INFO L225 Difference]: With dead ends: 1642 [2024-11-08 17:04:44,185 INFO L226 Difference]: Without dead ends: 1642 [2024-11-08 17:04:44,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=1085, Unknown=20, NotChecked=438, Total=1722 [2024-11-08 17:04:44,186 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 1175 mSDsluCounter, 9256 mSDsCounter, 0 mSdLazyCounter, 10030 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 10031 SdHoareTripleChecker+Invalid, 10052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 10030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:04:44,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 10031 Invalid, 10052 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 10030 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-08 17:04:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2024-11-08 17:04:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1612. [2024-11-08 17:04:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1234 states have (on average 1.6588330632090762) internal successors, (2047), 1600 states have internal predecessors, (2047), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:04:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2065 transitions. [2024-11-08 17:04:44,207 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2065 transitions. Word has length 97 [2024-11-08 17:04:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:04:44,207 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 2065 transitions. [2024-11-08 17:04:44,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.045454545454546) internal successors, (155), 24 states have internal predecessors, (155), 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-11-08 17:04:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2065 transitions. [2024-11-08 17:04:44,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 17:04:44,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:04:44,209 INFO L215 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-11-08 17:04:44,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 17:04:44,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:04:44,414 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:04:44,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:04:44,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1723365985, now seen corresponding path program 1 times [2024-11-08 17:04:44,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:04:44,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484324958] [2024-11-08 17:04:44,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:44,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:04:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:45,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:04:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:04:45,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:04:45,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484324958] [2024-11-08 17:04:45,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484324958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:04:45,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:04:45,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:04:45,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547777929] [2024-11-08 17:04:45,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:04:45,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 17:04:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:04:45,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 17:04:45,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:04:45,374 INFO L87 Difference]: Start difference. First operand 1612 states and 2065 transitions. Second operand has 15 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 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-11-08 17:04:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:04:48,118 INFO L93 Difference]: Finished difference Result 1651 states and 2114 transitions. [2024-11-08 17:04:48,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:04:48,119 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 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-11-08 17:04:48,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:04:48,121 INFO L225 Difference]: With dead ends: 1651 [2024-11-08 17:04:48,121 INFO L226 Difference]: Without dead ends: 1651 [2024-11-08 17:04:48,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:04:48,122 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 1213 mSDsluCounter, 5963 mSDsCounter, 0 mSdLazyCounter, 4590 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 6738 SdHoareTripleChecker+Invalid, 4617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:04:48,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 6738 Invalid, 4617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4590 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 17:04:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2024-11-08 17:04:48,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1647. [2024-11-08 17:04:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1268 states have (on average 1.6435331230283912) internal successors, (2084), 1633 states have internal predecessors, (2084), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 17:04:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2104 transitions. [2024-11-08 17:04:48,144 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2104 transitions. Word has length 100 [2024-11-08 17:04:48,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:04:48,145 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2104 transitions. [2024-11-08 17:04:48,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 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-11-08 17:04:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2104 transitions. [2024-11-08 17:04:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 17:04:48,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:04:48,146 INFO L215 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-11-08 17:04:48,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 17:04:48,147 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:04:48,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:04:48,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1723365984, now seen corresponding path program 1 times [2024-11-08 17:04:48,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:04:48,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41196635] [2024-11-08 17:04:48,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:48,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:04:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:49,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:04:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:04:49,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:04:49,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41196635] [2024-11-08 17:04:49,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41196635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:04:49,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:04:49,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 17:04:49,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110940893] [2024-11-08 17:04:49,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:04:49,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:04:49,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:04:49,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:04:49,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:04:49,614 INFO L87 Difference]: Start difference. First operand 1647 states and 2104 transitions. Second operand has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 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-11-08 17:04:54,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:04:54,146 INFO L93 Difference]: Finished difference Result 1650 states and 2112 transitions. [2024-11-08 17:04:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:04:54,146 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 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-11-08 17:04:54,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:04:54,148 INFO L225 Difference]: With dead ends: 1650 [2024-11-08 17:04:54,148 INFO L226 Difference]: Without dead ends: 1650 [2024-11-08 17:04:54,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-08 17:04:54,150 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 1209 mSDsluCounter, 6238 mSDsCounter, 0 mSdLazyCounter, 6881 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 7008 SdHoareTripleChecker+Invalid, 6904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:04:54,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 7008 Invalid, 6904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 6881 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 17:04:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2024-11-08 17:04:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1647. [2024-11-08 17:04:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1268 states have (on average 1.6419558359621451) internal successors, (2082), 1633 states have internal predecessors, (2082), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 17:04:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2102 transitions. [2024-11-08 17:04:54,164 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2102 transitions. Word has length 100 [2024-11-08 17:04:54,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:04:54,165 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2102 transitions. [2024-11-08 17:04:54,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 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-11-08 17:04:54,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2102 transitions. [2024-11-08 17:04:54,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 17:04:54,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:04:54,166 INFO L215 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] [2024-11-08 17:04:54,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 17:04:54,166 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:04:54,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:04:54,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1808424144, now seen corresponding path program 1 times [2024-11-08 17:04:54,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:04:54,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912969431] [2024-11-08 17:04:54,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:54,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:04:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:55,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:04:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:04:55,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:04:55,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912969431] [2024-11-08 17:04:55,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912969431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:04:55,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143688656] [2024-11-08 17:04:55,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:55,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:04:55,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:04:55,192 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:04:55,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 17:04:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:55,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 17:04:55,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:04:55,542 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-11-08 17:04:55,634 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:04:55,634 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-11-08 17:04:55,646 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-11-08 17:04:55,720 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:55,720 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-11-08 17:04:55,750 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:55,751 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-11-08 17:04:55,810 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:55,811 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-11-08 17:04:55,869 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:55,870 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-11-08 17:04:55,927 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:55,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 42 treesize of output 41 [2024-11-08 17:04:55,941 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-11-08 17:04:55,961 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 17:04:55,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-11-08 17:04:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:04:55,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:04:56,825 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-08 17:04:56,825 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-11-08 17:04:56,853 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2307 (Array Int Int)) (v_ArrVal_2306 (Array Int Int)) (v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2311 (Array Int Int))) (= (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~mem50#1.base| v_ArrVal_2311))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2304)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2305)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2306)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2307)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-08 17:04:56,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143688656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:04:56,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:04:56,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 21 [2024-11-08 17:04:56,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334622866] [2024-11-08 17:04:56,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:04:56,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 17:04:56,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:04:56,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 17:04:56,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=813, Unknown=45, NotChecked=60, Total=1056 [2024-11-08 17:04:56,857 INFO L87 Difference]: Start difference. First operand 1647 states and 2102 transitions. Second operand has 22 states, 20 states have (on average 7.25) internal successors, (145), 20 states have internal predecessors, (145), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:05:01,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:05:01,274 INFO L93 Difference]: Finished difference Result 1649 states and 2110 transitions. [2024-11-08 17:05:01,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:05:01,274 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.25) internal successors, (145), 20 states have internal predecessors, (145), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2024-11-08 17:05:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:05:01,276 INFO L225 Difference]: With dead ends: 1649 [2024-11-08 17:05:01,276 INFO L226 Difference]: Without dead ends: 1649 [2024-11-08 17:05:01,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=263, Invalid=1502, Unknown=45, NotChecked=82, Total=1892 [2024-11-08 17:05:01,277 INFO L432 NwaCegarLoop]: 769 mSDtfsCounter, 1213 mSDsluCounter, 10449 mSDsCounter, 0 mSdLazyCounter, 7583 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 11218 SdHoareTripleChecker+Invalid, 7604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 7583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:05:01,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 11218 Invalid, 7604 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 7583 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 17:05:01,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2024-11-08 17:05:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1646. [2024-11-08 17:05:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1268 states have (on average 1.640378548895899) internal successors, (2080), 1632 states have internal predecessors, (2080), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 17:05:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2100 transitions. [2024-11-08 17:05:01,295 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2100 transitions. Word has length 101 [2024-11-08 17:05:01,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:05:01,296 INFO L471 AbstractCegarLoop]: Abstraction has 1646 states and 2100 transitions. [2024-11-08 17:05:01,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.25) internal successors, (145), 20 states have internal predecessors, (145), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:05:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2100 transitions. [2024-11-08 17:05:01,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 17:05:01,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:05:01,297 INFO L215 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] [2024-11-08 17:05:01,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-08 17:05:01,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-08 17:05:01,498 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:05:01,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:05:01,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1808424145, now seen corresponding path program 1 times [2024-11-08 17:05:01,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:05:01,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270617169] [2024-11-08 17:05:01,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:05:01,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:05:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:05:02,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:05:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:05:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:05:03,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:05:03,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270617169] [2024-11-08 17:05:03,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270617169] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:05:03,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614050757] [2024-11-08 17:05:03,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:05:03,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:05:03,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:05:03,098 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:05:03,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 17:05:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:05:03,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-08 17:05:03,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:05:03,505 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-11-08 17:05:03,626 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:05:03,626 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-11-08 17:05:03,637 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-11-08 17:05:03,646 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-11-08 17:05:03,649 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-11-08 17:05:03,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 22 treesize of output 10 [2024-11-08 17:05:03,712 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-11-08 17:05:03,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:05:03,898 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-11-08 17:05:03,905 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-11-08 17:05:04,019 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:05:04,020 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-11-08 17:05:04,025 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-11-08 17:05:04,125 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:05:04,125 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-11-08 17:05:04,135 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-11-08 17:05:04,220 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:05:04,220 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-11-08 17:05:04,227 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-11-08 17:05:04,306 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:05:04,307 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-11-08 17:05:04,317 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-11-08 17:05:04,340 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-11-08 17:05:04,348 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-11-08 17:05:04,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:05:04,362 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-11-08 17:05:04,369 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:05:04,369 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-11-08 17:05:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:05:04,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:05:09,430 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2498 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2496))) (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~mem53#1.base| v_ArrVal_2497) .cse0 v_ArrVal_2499) (select (select (store .cse1 .cse0 v_ArrVal_2498) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2501))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2500 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (or (forall ((v_ArrVal_2502 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2496))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2498))) (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~mem53#1.base| v_ArrVal_2497) .cse3 v_ArrVal_2499) .cse4 v_ArrVal_2501) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2502) (select (select (store .cse5 .cse4 v_ArrVal_2500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))))) is different from false [2024-11-08 17:05:17,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:05:17,067 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-11-08 17:05:17,817 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2500 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2498 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2502 Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2507 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_7| |c_ULTIMATE.start_main_#t~mem50#1.base|) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2507))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2494))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2496))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2498))) (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~mem50#1.base| v_ArrVal_2508) .cse0 v_ArrVal_2495) .cse1 v_ArrVal_2497) .cse2 v_ArrVal_2499) .cse3 v_ArrVal_2501) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2502) (select (select (store .cse5 .cse3 v_ArrVal_2500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_26))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_prenex_24))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_prenex_22))) (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~mem50#1.base| v_prenex_25) .cse9 v_prenex_23) .cse10 v_prenex_21) .cse11 v_prenex_18) (select (select (store .cse12 .cse11 v_prenex_19) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_17))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2024-11-08 17:05:17,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614050757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:05:17,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:05:17,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2024-11-08 17:05:17,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862199416] [2024-11-08 17:05:17,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:05:17,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 17:05:17,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:05:17,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 17:05:17,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1057, Unknown=52, NotChecked=138, Total=1406 [2024-11-08 17:05:17,826 INFO L87 Difference]: Start difference. First operand 1646 states and 2100 transitions. Second operand has 26 states, 24 states have (on average 6.291666666666667) internal successors, (151), 24 states have internal predecessors, (151), 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-11-08 17:05:49,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:05:49,338 INFO L93 Difference]: Finished difference Result 1648 states and 2108 transitions. [2024-11-08 17:05:49,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 17:05:49,339 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.291666666666667) internal successors, (151), 24 states have internal predecessors, (151), 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 101 [2024-11-08 17:05:49,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:05:49,341 INFO L225 Difference]: With dead ends: 1648 [2024-11-08 17:05:49,341 INFO L226 Difference]: Without dead ends: 1648 [2024-11-08 17:05:49,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=304, Invalid=2102, Unknown=52, NotChecked=194, Total=2652 [2024-11-08 17:05:49,343 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 1216 mSDsluCounter, 7174 mSDsCounter, 0 mSdLazyCounter, 8390 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 7941 SdHoareTripleChecker+Invalid, 8414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 8390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:05:49,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 7941 Invalid, 8414 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 8390 Invalid, 0 Unknown, 0 Unchecked, 29.5s Time] [2024-11-08 17:05:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2024-11-08 17:05:49,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1610. [2024-11-08 17:05:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1234 states have (on average 1.6555915721231766) internal successors, (2043), 1598 states have internal predecessors, (2043), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:05:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2061 transitions. [2024-11-08 17:05:49,365 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2061 transitions. Word has length 101 [2024-11-08 17:05:49,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:05:49,366 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2061 transitions. [2024-11-08 17:05:49,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.291666666666667) internal successors, (151), 24 states have internal predecessors, (151), 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-11-08 17:05:49,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2061 transitions. [2024-11-08 17:05:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 17:05:49,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:05:49,368 INFO L215 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-11-08 17:05:49,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 17:05:49,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-08 17:05:49,572 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:05:49,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:05:49,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1243633797, now seen corresponding path program 1 times [2024-11-08 17:05:49,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:05:49,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780028560] [2024-11-08 17:05:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:05:49,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:05:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:05:51,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:05:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:05:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:05:51,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:05:51,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780028560] [2024-11-08 17:05:51,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780028560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:05:51,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:05:51,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 17:05:51,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979318613] [2024-11-08 17:05:51,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:05:51,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:05:51,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:05:51,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:05:51,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:05:51,119 INFO L87 Difference]: Start difference. First operand 1610 states and 2061 transitions. Second operand has 16 states, 15 states have (on average 6.733333333333333) internal successors, (101), 15 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-11-08 17:06:10,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:06:10,986 INFO L93 Difference]: Finished difference Result 1655 states and 2116 transitions. [2024-11-08 17:06:10,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:06:10,987 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.733333333333333) internal successors, (101), 15 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-11-08 17:06:10,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:06:10,990 INFO L225 Difference]: With dead ends: 1655 [2024-11-08 17:06:10,990 INFO L226 Difference]: Without dead ends: 1655 [2024-11-08 17:06:10,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-11-08 17:06:10,991 INFO L432 NwaCegarLoop]: 774 mSDtfsCounter, 1252 mSDsluCounter, 8240 mSDsCounter, 0 mSdLazyCounter, 6049 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 9014 SdHoareTripleChecker+Invalid, 6074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:06:10,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 9014 Invalid, 6074 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 6049 Invalid, 0 Unknown, 0 Unchecked, 19.1s Time] [2024-11-08 17:06:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2024-11-08 17:06:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1651. [2024-11-08 17:06:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1274 states have (on average 1.6373626373626373) internal successors, (2086), 1637 states have internal predecessors, (2086), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 17:06:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2106 transitions. [2024-11-08 17:06:11,014 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2106 transitions. Word has length 103 [2024-11-08 17:06:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:06:11,014 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2106 transitions. [2024-11-08 17:06:11,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.733333333333333) internal successors, (101), 15 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-11-08 17:06:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2106 transitions. [2024-11-08 17:06:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 17:06:11,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:06:11,016 INFO L215 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-11-08 17:06:11,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 17:06:11,016 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:06:11,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:06:11,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1243633798, now seen corresponding path program 1 times [2024-11-08 17:06:11,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:06:11,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064381649] [2024-11-08 17:06:11,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:06:11,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:06:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:06:13,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:06:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:06:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:06:13,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:06:13,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064381649] [2024-11-08 17:06:13,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064381649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:06:13,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:06:13,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 17:06:13,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955932781] [2024-11-08 17:06:13,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:06:13,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 17:06:13,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:06:13,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 17:06:13,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:06:13,770 INFO L87 Difference]: Start difference. First operand 1651 states and 2106 transitions. Second operand has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 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-11-08 17:06:37,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:06:37,451 INFO L93 Difference]: Finished difference Result 1654 states and 2114 transitions. [2024-11-08 17:06:37,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:06:37,452 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 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-11-08 17:06:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:06:37,453 INFO L225 Difference]: With dead ends: 1654 [2024-11-08 17:06:37,454 INFO L226 Difference]: Without dead ends: 1654 [2024-11-08 17:06:37,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-11-08 17:06:37,455 INFO L432 NwaCegarLoop]: 768 mSDtfsCounter, 1209 mSDsluCounter, 5494 mSDsCounter, 0 mSdLazyCounter, 6372 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 6262 SdHoareTripleChecker+Invalid, 6395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:06:37,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 6262 Invalid, 6395 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 6372 Invalid, 0 Unknown, 0 Unchecked, 22.5s Time] [2024-11-08 17:06:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2024-11-08 17:06:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1651. [2024-11-08 17:06:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1274 states have (on average 1.6357927786499216) internal successors, (2084), 1637 states have internal predecessors, (2084), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 17:06:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2104 transitions. [2024-11-08 17:06:37,473 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2104 transitions. Word has length 103 [2024-11-08 17:06:37,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:06:37,474 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2104 transitions. [2024-11-08 17:06:37,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 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-11-08 17:06:37,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2104 transitions. [2024-11-08 17:06:37,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 17:06:37,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:06:37,475 INFO L215 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-11-08 17:06:37,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 17:06:37,475 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:06:37,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:06:37,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1305450572, now seen corresponding path program 1 times [2024-11-08 17:06:37,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:06:37,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752399489] [2024-11-08 17:06:37,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:06:37,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:06:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:06:38,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:06:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:06:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:06:38,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:06:38,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752399489] [2024-11-08 17:06:38,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752399489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:06:38,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:06:38,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:06:38,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739089367] [2024-11-08 17:06:38,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:06:38,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:06:38,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:06:38,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:06:38,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:06:38,383 INFO L87 Difference]: Start difference. First operand 1651 states and 2104 transitions. Second operand has 7 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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-11-08 17:06:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:06:44,593 INFO L93 Difference]: Finished difference Result 1653 states and 2112 transitions. [2024-11-08 17:06:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:06:44,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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 104 [2024-11-08 17:06:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:06:44,595 INFO L225 Difference]: With dead ends: 1653 [2024-11-08 17:06:44,596 INFO L226 Difference]: Without dead ends: 1653 [2024-11-08 17:06:44,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:06:44,596 INFO L432 NwaCegarLoop]: 1250 mSDtfsCounter, 6 mSDsluCounter, 3501 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4751 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:06:44,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4751 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-08 17:06:44,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-11-08 17:06:44,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1650. [2024-11-08 17:06:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1274 states have (on average 1.6342229199372056) internal successors, (2082), 1636 states have internal predecessors, (2082), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 17:06:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2102 transitions. [2024-11-08 17:06:44,613 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2102 transitions. Word has length 104 [2024-11-08 17:06:44,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:06:44,613 INFO L471 AbstractCegarLoop]: Abstraction has 1650 states and 2102 transitions. [2024-11-08 17:06:44,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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-11-08 17:06:44,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2102 transitions. [2024-11-08 17:06:44,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 17:06:44,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:06:44,614 INFO L215 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-11-08 17:06:44,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 17:06:44,615 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:06:44,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:06:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1305450571, now seen corresponding path program 1 times [2024-11-08 17:06:44,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:06:44,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174861991] [2024-11-08 17:06:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:06:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:06:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:06:47,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:06:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:06:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:06:48,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:06:48,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174861991] [2024-11-08 17:06:48,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174861991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:06:48,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2196869] [2024-11-08 17:06:48,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:06:48,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:06:48,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:06:48,297 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:06:48,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 17:06:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:06:48,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-08 17:06:48,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:06:48,747 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-11-08 17:06:49,249 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:06:49,249 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-11-08 17:06:49,267 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-11-08 17:06:49,391 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-11-08 17:06:49,408 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-11-08 17:06:49,840 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-11-08 17:06:49,855 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-11-08 17:06:50,585 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:50,585 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-11-08 17:06:50,598 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-11-08 17:06:51,227 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:51,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 73 treesize of output 66 [2024-11-08 17:06:51,241 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-11-08 17:06:51,660 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:51,660 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-11-08 17:06:51,672 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-11-08 17:06:52,056 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:52,057 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-11-08 17:06:52,067 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-11-08 17:06:52,450 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:52,450 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-11-08 17:06:52,461 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-11-08 17:06:52,964 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-08 17:06:52,964 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 17 treesize of output 17 [2024-11-08 17:06:53,044 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-08 17:06:53,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-08 17:06:53,292 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:53,292 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-11-08 17:06:53,302 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-11-08 17:06:53,362 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-11-08 17:06:53,372 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-11-08 17:06:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:06:53,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:06:53,849 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2976 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2976) |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~mem56#1.base| v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 17:06:55,077 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 (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2974) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (forall ((v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2975 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2973))) (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_2974) .cse2 v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2975) (select (select (store .cse3 .cse2 v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-11-08 17:06:55,185 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2971))) (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~mem54#1.base| v_ArrVal_2972) .cse0 v_ArrVal_2974) (select (select (store .cse1 .cse0 v_ArrVal_2973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2976))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 40)))) (forall ((v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2975 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2971))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2973))) (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~mem54#1.base| v_ArrVal_2972) .cse3 v_ArrVal_2974) .cse4 v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2975) (select (select (store .cse5 .cse4 v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false [2024-11-08 17:06:55,249 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 (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2971))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2972) .cse1 v_ArrVal_2974) (select (select (store .cse2 .cse1 v_ArrVal_2973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2976))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2975 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2971))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2973))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2972) .cse4 v_ArrVal_2974) .cse5 v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2975) (select (select (store .cse6 .cse5 v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2024-11-08 17:06:55,362 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2969))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2971))) (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~mem53#1.base| v_ArrVal_2970) .cse0 v_ArrVal_2972) .cse1 v_ArrVal_2974) (select (select (store .cse2 .cse1 v_ArrVal_2973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2976))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 40)))) (forall ((v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2975 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2969))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2971))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2973))) (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~mem53#1.base| v_ArrVal_2970) .cse5 v_ArrVal_2972) .cse6 v_ArrVal_2974) .cse7 v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2975) (select (select (store .cse8 .cse7 v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-08 17:06:58,296 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 (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2967))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2969))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_2971))) (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_2968) .cse1 v_ArrVal_2970) .cse2 v_ArrVal_2972) .cse3 v_ArrVal_2974) (select (select (store .cse4 .cse3 v_ArrVal_2973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_2976))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2975 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2967))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_2969))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_2971))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2973))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2968) .cse8 v_ArrVal_2970) .cse9 v_ArrVal_2972) .cse10 v_ArrVal_2974) .cse11 v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2975) (select (select (store .cse12 .cse11 v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))))))) is different from false [2024-11-08 17:06:58,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:06:58,619 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 1180 treesize of output 1198 [2024-11-08 17:07:03,048 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_37 Int)) (or (forall ((v_ArrVal_2977 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2975 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_34))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse9 (store .cse10 .cse0 v_prenex_28))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_prenex_38))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_prenex_35))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_prenex_31))) (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~mem50#1.base| v_prenex_32) .cse0 v_prenex_27) .cse1 v_prenex_36) .cse2 v_prenex_33) .cse3 v_prenex_30) .cse4 v_prenex_29) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| v_prenex_37 v_ArrVal_2975) (select (select (store .cse6 .cse4 v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_37))) (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (v_ArrVal_2983 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2982))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_ArrVal_2967))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_2969))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_2971))) (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~mem50#1.base| v_ArrVal_2983) .cse11 v_ArrVal_2968) .cse12 v_ArrVal_2970) .cse13 v_ArrVal_2972) .cse14 v_ArrVal_2974) (select (select (store .cse15 .cse14 v_ArrVal_2973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_2976))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))) is different from false [2024-11-08 17:07:03,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2196869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:07:03,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:07:03,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2024-11-08 17:07:03,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106102489] [2024-11-08 17:07:03,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:07:03,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 17:07:03,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:07:03,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 17:07:03,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1434, Unknown=24, NotChecked=588, Total=2256 [2024-11-08 17:07:03,099 INFO L87 Difference]: Start difference. First operand 1650 states and 2102 transitions. Second operand has 34 states, 31 states have (on average 5.451612903225806) internal successors, (169), 32 states have internal predecessors, (169), 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-11-08 17:07:55,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:07:55,873 INFO L93 Difference]: Finished difference Result 1652 states and 2110 transitions. [2024-11-08 17:07:55,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 17:07:55,874 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 5.451612903225806) internal successors, (169), 32 states have internal predecessors, (169), 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-11-08 17:07:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:07:55,876 INFO L225 Difference]: With dead ends: 1652 [2024-11-08 17:07:55,876 INFO L226 Difference]: Without dead ends: 1652 [2024-11-08 17:07:55,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=375, Invalid=2599, Unknown=24, NotChecked=784, Total=3782 [2024-11-08 17:07:55,877 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 1219 mSDsluCounter, 7407 mSDsCounter, 0 mSdLazyCounter, 8240 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 8174 SdHoareTripleChecker+Invalid, 8271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 8240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:07:55,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 8174 Invalid, 8271 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 8240 Invalid, 0 Unknown, 0 Unchecked, 49.3s Time] [2024-11-08 17:07:55,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2024-11-08 17:07:55,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1608. [2024-11-08 17:07:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1234 states have (on average 1.652350081037277) internal successors, (2039), 1596 states have internal predecessors, (2039), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:07:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2057 transitions. [2024-11-08 17:07:55,900 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2057 transitions. Word has length 104 [2024-11-08 17:07:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:07:55,901 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2057 transitions. [2024-11-08 17:07:55,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 5.451612903225806) internal successors, (169), 32 states have internal predecessors, (169), 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-11-08 17:07:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2057 transitions. [2024-11-08 17:07:55,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 17:07:55,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:07:55,902 INFO L215 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-11-08 17:07:55,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 17:07:56,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-08 17:07:56,107 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:07:56,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:07:56,107 INFO L85 PathProgramCache]: Analyzing trace with hash 707194630, now seen corresponding path program 1 times [2024-11-08 17:07:56,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:07:56,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667153267] [2024-11-08 17:07:56,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:07:56,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:07:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:07:58,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:07:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:07:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:07:58,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:07:58,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667153267] [2024-11-08 17:07:58,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667153267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:07:58,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:07:58,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 17:07:58,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916360107] [2024-11-08 17:07:58,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:07:58,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:07:58,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:07:58,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:07:58,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:07:58,765 INFO L87 Difference]: Start difference. First operand 1608 states and 2057 transitions. Second operand has 18 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 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-11-08 17:08:26,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:08:26,935 INFO L93 Difference]: Finished difference Result 1693 states and 2166 transitions. [2024-11-08 17:08:26,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:08:26,936 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 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-11-08 17:08:26,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:08:26,938 INFO L225 Difference]: With dead ends: 1693 [2024-11-08 17:08:26,938 INFO L226 Difference]: Without dead ends: 1693 [2024-11-08 17:08:26,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2024-11-08 17:08:26,939 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 1268 mSDsluCounter, 6051 mSDsCounter, 0 mSdLazyCounter, 4742 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 6831 SdHoareTripleChecker+Invalid, 4773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:08:26,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 6831 Invalid, 4773 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 4742 Invalid, 0 Unknown, 0 Unchecked, 26.9s Time] [2024-11-08 17:08:26,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2024-11-08 17:08:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1655. [2024-11-08 17:08:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1280 states have (on average 1.63125) internal successors, (2088), 1641 states have internal predecessors, (2088), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 17:08:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2108 transitions. [2024-11-08 17:08:26,957 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2108 transitions. Word has length 106 [2024-11-08 17:08:26,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:08:26,957 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2108 transitions. [2024-11-08 17:08:26,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 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-11-08 17:08:26,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2108 transitions. [2024-11-08 17:08:26,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 17:08:26,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:08:26,959 INFO L215 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-11-08 17:08:26,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-08 17:08:26,959 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:08:26,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:08:26,959 INFO L85 PathProgramCache]: Analyzing trace with hash 707194631, now seen corresponding path program 1 times [2024-11-08 17:08:26,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:08:26,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514064158] [2024-11-08 17:08:26,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:08:26,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:08:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:31,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:08:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:08:31,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:08:31,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514064158] [2024-11-08 17:08:31,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514064158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:08:31,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:08:31,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:08:31,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273866170] [2024-11-08 17:08:31,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:08:31,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:08:31,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:08:31,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:08:31,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:08:31,433 INFO L87 Difference]: Start difference. First operand 1655 states and 2108 transitions. Second operand has 11 states, 10 states have (on average 10.4) internal successors, (104), 10 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-11-08 17:08:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:08:54,318 INFO L93 Difference]: Finished difference Result 1679 states and 2142 transitions. [2024-11-08 17:08:54,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:08:54,319 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.4) internal successors, (104), 10 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-11-08 17:08:54,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:08:54,321 INFO L225 Difference]: With dead ends: 1679 [2024-11-08 17:08:54,321 INFO L226 Difference]: Without dead ends: 1679 [2024-11-08 17:08:54,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:08:54,323 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 2348 mSDsluCounter, 3252 mSDsCounter, 0 mSdLazyCounter, 3553 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2356 SdHoareTripleChecker+Valid, 4022 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:08:54,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2356 Valid, 4022 Invalid, 3582 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 3553 Invalid, 0 Unknown, 0 Unchecked, 21.7s Time] [2024-11-08 17:08:54,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2024-11-08 17:08:54,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1654. [2024-11-08 17:08:54,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1280 states have (on average 1.628125) internal successors, (2084), 1640 states have internal predecessors, (2084), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 17:08:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2104 transitions. [2024-11-08 17:08:54,344 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2104 transitions. Word has length 106 [2024-11-08 17:08:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:08:54,344 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2104 transitions. [2024-11-08 17:08:54,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.4) internal successors, (104), 10 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-11-08 17:08:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2104 transitions. [2024-11-08 17:08:54,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 17:08:54,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:08:54,346 INFO L215 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-11-08 17:08:54,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-08 17:08:54,346 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:08:54,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:08:54,347 INFO L85 PathProgramCache]: Analyzing trace with hash 251518327, now seen corresponding path program 1 times [2024-11-08 17:08:54,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:08:54,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547478987] [2024-11-08 17:08:54,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:08:54,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:08:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:59,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:08:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:08:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:08:59,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:08:59,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547478987] [2024-11-08 17:08:59,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547478987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:08:59,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:08:59,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 17:08:59,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813281775] [2024-11-08 17:08:59,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:08:59,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:08:59,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:08:59,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:08:59,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:08:59,417 INFO L87 Difference]: Start difference. First operand 1654 states and 2104 transitions. Second operand has 16 states, 15 states have (on average 7.0) internal successors, (105), 15 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-11-08 17:09:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:36,511 INFO L93 Difference]: Finished difference Result 1678 states and 2140 transitions. [2024-11-08 17:09:36,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:09:36,512 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.0) internal successors, (105), 15 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-11-08 17:09:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:36,514 INFO L225 Difference]: With dead ends: 1678 [2024-11-08 17:09:36,514 INFO L226 Difference]: Without dead ends: 1678 [2024-11-08 17:09:36,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2024-11-08 17:09:36,515 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 2401 mSDsluCounter, 8199 mSDsCounter, 0 mSdLazyCounter, 6026 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2409 SdHoareTripleChecker+Valid, 8974 SdHoareTripleChecker+Invalid, 6058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 6026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:36,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2409 Valid, 8974 Invalid, 6058 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 6026 Invalid, 0 Unknown, 0 Unchecked, 35.3s Time] [2024-11-08 17:09:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2024-11-08 17:09:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1606. [2024-11-08 17:09:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1234 states have (on average 1.6491085899513775) internal successors, (2035), 1594 states have internal predecessors, (2035), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:09:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2053 transitions. [2024-11-08 17:09:36,542 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2053 transitions. Word has length 107 [2024-11-08 17:09:36,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:36,543 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 2053 transitions. [2024-11-08 17:09:36,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.0) internal successors, (105), 15 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-11-08 17:09:36,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2053 transitions. [2024-11-08 17:09:36,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:09:36,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:36,544 INFO L215 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-11-08 17:09:36,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-08 17:09:36,544 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:09:36,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:36,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1221298810, now seen corresponding path program 1 times [2024-11-08 17:09:36,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:36,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446460125] [2024-11-08 17:09:36,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:36,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:09:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:40,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:40,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446460125] [2024-11-08 17:09:40,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446460125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:40,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:40,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 17:09:40,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789483355] [2024-11-08 17:09:40,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:40,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 17:09:40,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:40,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 17:09:40,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:09:40,008 INFO L87 Difference]: Start difference. First operand 1606 states and 2053 transitions. Second operand has 19 states, 18 states have (on average 5.944444444444445) internal successors, (107), 18 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-11-08 17:10:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:10:16,850 INFO L93 Difference]: Finished difference Result 1689 states and 2158 transitions. [2024-11-08 17:10:16,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:10:16,851 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.944444444444445) internal successors, (107), 18 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-11-08 17:10:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:10:16,853 INFO L225 Difference]: With dead ends: 1689 [2024-11-08 17:10:16,853 INFO L226 Difference]: Without dead ends: 1689 [2024-11-08 17:10:16,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2024-11-08 17:10:16,854 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 1290 mSDsluCounter, 6240 mSDsCounter, 0 mSdLazyCounter, 5766 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 7016 SdHoareTripleChecker+Invalid, 5796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:10:16,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 7016 Invalid, 5796 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 5766 Invalid, 0 Unknown, 0 Unchecked, 35.0s Time] [2024-11-08 17:10:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2024-11-08 17:10:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1659. [2024-11-08 17:10:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1286 states have (on average 1.625194401244168) internal successors, (2090), 1645 states have internal predecessors, (2090), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 17:10:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2110 transitions. [2024-11-08 17:10:16,875 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2110 transitions. Word has length 109 [2024-11-08 17:10:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:10:16,875 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2110 transitions. [2024-11-08 17:10:16,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.944444444444445) internal successors, (107), 18 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-11-08 17:10:16,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2110 transitions. [2024-11-08 17:10:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:10:16,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:10:16,878 INFO L215 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-11-08 17:10:16,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-08 17:10:16,878 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:10:16,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:10:16,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1221298809, now seen corresponding path program 1 times [2024-11-08 17:10:16,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:10:16,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724453455] [2024-11-08 17:10:16,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:10:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:10:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:17,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:10:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:10:17,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:10:17,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724453455] [2024-11-08 17:10:17,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724453455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:10:17,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:10:17,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:10:17,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264668547] [2024-11-08 17:10:17,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:10:17,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:10:17,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:10:17,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:10:17,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:10:17,333 INFO L87 Difference]: Start difference. First operand 1659 states and 2110 transitions. Second operand has 6 states, 5 states have (on average 21.4) internal successors, (107), 5 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-11-08 17:10:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:10:26,859 INFO L93 Difference]: Finished difference Result 1683 states and 2144 transitions. [2024-11-08 17:10:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:10:26,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.4) internal successors, (107), 5 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-11-08 17:10:26,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:10:26,862 INFO L225 Difference]: With dead ends: 1683 [2024-11-08 17:10:26,862 INFO L226 Difference]: Without dead ends: 1683 [2024-11-08 17:10:26,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:10:26,863 INFO L432 NwaCegarLoop]: 1237 mSDtfsCounter, 22 mSDsluCounter, 3474 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4711 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:10:26,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4711 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-11-08 17:10:26,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2024-11-08 17:10:26,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1658. [2024-11-08 17:10:26,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1286 states have (on average 1.6220839813374806) internal successors, (2086), 1644 states have internal predecessors, (2086), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-08 17:10:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2106 transitions. [2024-11-08 17:10:26,887 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2106 transitions. Word has length 109 [2024-11-08 17:10:26,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:10:26,888 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2106 transitions. [2024-11-08 17:10:26,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.4) internal successors, (107), 5 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-11-08 17:10:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2106 transitions. [2024-11-08 17:10:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 17:10:26,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:10:26,889 INFO L215 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-11-08 17:10:26,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-08 17:10:26,890 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:10:26,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:10:26,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1734788503, now seen corresponding path program 1 times [2024-11-08 17:10:26,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:10:26,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499462658] [2024-11-08 17:10:26,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:10:26,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:10:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:27,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:10:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:10:27,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:10:27,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499462658] [2024-11-08 17:10:27,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499462658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:10:27,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:10:27,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:10:27,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385451765] [2024-11-08 17:10:27,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:10:27,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:10:27,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:10:27,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:10:27,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:10:27,390 INFO L87 Difference]: Start difference. First operand 1658 states and 2106 transitions. Second operand has 6 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-11-08 17:10:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:10:37,181 INFO L93 Difference]: Finished difference Result 1682 states and 2142 transitions. [2024-11-08 17:10:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:10:37,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-11-08 17:10:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:10:37,184 INFO L225 Difference]: With dead ends: 1682 [2024-11-08 17:10:37,184 INFO L226 Difference]: Without dead ends: 1682 [2024-11-08 17:10:37,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:10:37,185 INFO L432 NwaCegarLoop]: 1237 mSDtfsCounter, 21 mSDsluCounter, 3484 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4721 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:10:37,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4721 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2024-11-08 17:10:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2024-11-08 17:10:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1604. [2024-11-08 17:10:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1234 states have (on average 1.6458670988654782) internal successors, (2031), 1592 states have internal predecessors, (2031), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:10:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2049 transitions. [2024-11-08 17:10:37,201 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2049 transitions. Word has length 110 [2024-11-08 17:10:37,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:10:37,201 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 2049 transitions. [2024-11-08 17:10:37,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-11-08 17:10:37,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2049 transitions. [2024-11-08 17:10:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 17:10:37,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:10:37,203 INFO L215 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-11-08 17:10:37,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-08 17:10:37,203 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:10:37,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:10:37,203 INFO L85 PathProgramCache]: Analyzing trace with hash -794441910, now seen corresponding path program 1 times [2024-11-08 17:10:37,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:10:37,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568205504] [2024-11-08 17:10:37,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:10:37,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:10:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:41,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:10:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:41,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-11-08 17:10:41,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:10:41,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568205504] [2024-11-08 17:10:41,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568205504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:10:41,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:10:41,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 17:10:41,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686484957] [2024-11-08 17:10:41,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:10:41,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 17:10:41,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:10:41,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 17:10:41,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:10:41,596 INFO L87 Difference]: Start difference. First operand 1604 states and 2049 transitions. Second operand has 20 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 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-11-08 17:11:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:11:16,663 INFO L93 Difference]: Finished difference Result 1687 states and 2152 transitions. [2024-11-08 17:11:16,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 17:11:16,663 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 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-11-08 17:11:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:11:16,665 INFO L225 Difference]: With dead ends: 1687 [2024-11-08 17:11:16,665 INFO L226 Difference]: Without dead ends: 1687 [2024-11-08 17:11:16,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 17:11:16,666 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 1243 mSDsluCounter, 7495 mSDsCounter, 0 mSdLazyCounter, 5665 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 8265 SdHoareTripleChecker+Invalid, 5693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 5665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:11:16,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 8265 Invalid, 5693 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 5665 Invalid, 0 Unknown, 0 Unchecked, 33.1s Time] [2024-11-08 17:11:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2024-11-08 17:11:16,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1659. [2024-11-08 17:11:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1288 states have (on average 1.6195652173913044) internal successors, (2086), 1645 states have internal predecessors, (2086), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-08 17:11:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2110 transitions. [2024-11-08 17:11:16,688 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2110 transitions. Word has length 110 [2024-11-08 17:11:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:11:16,689 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2110 transitions. [2024-11-08 17:11:16,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 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-11-08 17:11:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2110 transitions. [2024-11-08 17:11:16,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 17:11:16,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:11:16,691 INFO L215 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-11-08 17:11:16,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-08 17:11:16,691 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:11:16,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:11:16,692 INFO L85 PathProgramCache]: Analyzing trace with hash -794441909, now seen corresponding path program 1 times [2024-11-08 17:11:16,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:11:16,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405991874] [2024-11-08 17:11:16,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:11:16,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:11:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:11:21,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:11:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:11:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:11:21,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:11:21,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405991874] [2024-11-08 17:11:21,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405991874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:11:21,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:11:21,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-08 17:11:21,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690551805] [2024-11-08 17:11:21,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:11:21,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 17:11:21,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:11:21,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 17:11:21,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:11:21,492 INFO L87 Difference]: Start difference. First operand 1659 states and 2110 transitions. Second operand has 22 states, 21 states have (on average 5.142857142857143) internal successors, (108), 21 states have internal predecessors, (108), 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-11-08 17:12:01,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:01,267 INFO L93 Difference]: Finished difference Result 1686 states and 2150 transitions. [2024-11-08 17:12:01,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 17:12:01,268 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.142857142857143) internal successors, (108), 21 states have internal predecessors, (108), 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-11-08 17:12:01,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:01,270 INFO L225 Difference]: With dead ends: 1686 [2024-11-08 17:12:01,270 INFO L226 Difference]: Without dead ends: 1686 [2024-11-08 17:12:01,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=159, Invalid=1173, Unknown=0, NotChecked=0, Total=1332 [2024-11-08 17:12:01,271 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 1286 mSDsluCounter, 6707 mSDsCounter, 0 mSdLazyCounter, 6653 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 7482 SdHoareTripleChecker+Invalid, 6679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 6653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:01,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 7482 Invalid, 6679 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 6653 Invalid, 0 Unknown, 0 Unchecked, 37.3s Time] [2024-11-08 17:12:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2024-11-08 17:12:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1659. [2024-11-08 17:12:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1286 states have (on average 1.6205287713841368) internal successors, (2084), 1645 states have internal predecessors, (2084), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-08 17:12:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2108 transitions. [2024-11-08 17:12:01,288 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2108 transitions. Word has length 110 [2024-11-08 17:12:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:01,288 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2108 transitions. [2024-11-08 17:12:01,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.142857142857143) internal successors, (108), 21 states have internal predecessors, (108), 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-11-08 17:12:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2108 transitions. [2024-11-08 17:12:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 17:12:01,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:01,289 INFO L215 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] [2024-11-08 17:12:01,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-08 17:12:01,289 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:12:01,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:01,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2056131899, now seen corresponding path program 1 times [2024-11-08 17:12:01,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:01,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288493221] [2024-11-08 17:12:01,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:01,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:04,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:12:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:05,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:05,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288493221] [2024-11-08 17:12:05,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288493221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:12:05,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886465610] [2024-11-08 17:12:05,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:05,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:12:05,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:12:05,366 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:12:05,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 17:12:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:05,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-08 17:12:05,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:12:05,810 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-11-08 17:12:06,872 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:12:06,873 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-11-08 17:12:07,060 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-11-08 17:12:07,072 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-11-08 17:12:07,673 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:12:07,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 51 treesize of output 48 [2024-11-08 17:12:07,686 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-11-08 17:12:07,998 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:12:07,999 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-11-08 17:12:08,011 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-11-08 17:12:08,342 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:12:08,342 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-11-08 17:12:08,355 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-11-08 17:12:08,696 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:12:08,696 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-11-08 17:12:08,709 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-11-08 17:12:09,055 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:12:09,055 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-11-08 17:12:09,068 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-11-08 17:12:09,393 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-11-08 17:12:09,780 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-08 17:12:09,781 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-11-08 17:12:09,797 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-11-08 17:12:10,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:12:10,523 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-08 17:12:10,524 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-11-08 17:12:10,537 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-11-08 17:12:10,671 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-11-08 17:12:10,977 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-08 17:12:10,977 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-11-08 17:12:10,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:12:10,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:12:11,131 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int))) (or (not (= (let ((.cse0 (+ 40 |c_ULTIMATE.start_main_#t~mem58#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base|) .cse0 (select v_ArrVal_3944 .cse0))) v_ArrVal_3944)) (= (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~mem58#1.base| v_ArrVal_3944))) (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~mem58#1.base| v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) 1))) is different from false [2024-11-08 17:12:11,189 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int))) (let ((.cse1 (+ |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|) .cse1))) (or (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_3944))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse3 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select |c_#memory_$Pointer$#1.base| .cse2) .cse3 (select v_ArrVal_3944 .cse3))) v_ArrVal_3944)))))) is different from false [2024-11-08 17:12:11,342 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |c_ULTIMATE.start_main_#t~malloc57#1.base|))) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3943))) (or (not (= v_ArrVal_3944 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3944 .cse2))))) (= (select |c_#valid| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_3944))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) 1) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))) is different from false [2024-11-08 17:12:11,370 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-11-08 17:12:11,470 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_12|))) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3943))) (or (not (= v_ArrVal_3944 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3944 .cse2))))) (= (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_3944))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))) is different from false [2024-11-08 17:12:11,587 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int 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~malloc57#1.base_12|)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_3943)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3944))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_3944 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_3944 .cse5))))))))))) is different from false [2024-11-08 17:12:11,851 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3940)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3939))) (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~malloc57#1.base_12|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_3943)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_3944 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3944 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_3944))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|))))))) is different from false [2024-11-08 17:12:12,020 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (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_3940))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_3939))) (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~malloc57#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_3943)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_3944 .cse4))) v_ArrVal_3944)) (= (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_3944))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|))))))))) is different from false [2024-11-08 17:12:12,414 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3937 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3938)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse10 .cse9 v_ArrVal_3940))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3937) .cse9 v_ArrVal_3939))) (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~malloc57#1.base_12|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_3943)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_3944 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3944 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_3944))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|))))))))) is different from false [2024-11-08 17:12:12,553 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3937 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (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_3938))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_3940))) (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_3937) .cse10 v_ArrVal_3939))) (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~malloc57#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_3943)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_12| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_3944))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_3944 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_3944 .cse5))))))))))))))) is different from false [2024-11-08 17:12:12,856 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3937 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int)) (v_ArrVal_3935 (Array Int Int)) (v_ArrVal_3936 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3936)) (.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_3938))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_3940))) (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~mem53#1.base| v_ArrVal_3935) .cse9 v_ArrVal_3937) .cse10 v_ArrVal_3939))) (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~malloc57#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_3943)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_3944 (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_3944 .cse4))))) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_12| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_3944))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-11-08 17:12:13,029 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3937 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3945 (Array Int Int)) (v_ArrVal_3935 (Array Int Int)) (v_ArrVal_3936 (Array Int Int))) (let ((.cse4 (+ |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|) .cse4))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_3936))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3938))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_3940))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_3935) .cse10 v_ArrVal_3937) .cse11 v_ArrVal_3939))) (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~malloc57#1.base_12|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_3943))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3944 .cse2))) v_ArrVal_3944)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_12| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_3944))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) is different from false [2024-11-08 17:12:13,293 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3937 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3934 (Array Int Int)) (v_ArrVal_3945 (Array Int Int)) (v_ArrVal_3935 (Array Int Int)) (v_ArrVal_3936 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3933)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3936))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3938))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_3940))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3934) .cse9 v_ArrVal_3935) .cse10 v_ArrVal_3937) .cse11 v_ArrVal_3939))) (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~malloc57#1.base_12|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_3943)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_12| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3944))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_3944 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_3944 .cse5))))))))))))))))) is different from false [2024-11-08 17:12:13,440 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3937 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3934 (Array Int Int)) (v_ArrVal_3945 (Array Int Int)) (v_ArrVal_3935 (Array Int Int)) (v_ArrVal_3936 (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 ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_3933))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_3936))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3938))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_3940))) (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_3934) .cse10 v_ArrVal_3935) .cse11 v_ArrVal_3937) .cse12 v_ArrVal_3939))) (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~malloc57#1.base_12|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_3943)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_12| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3944))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_3944 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_3944 .cse5))))))))))))))))))) is different from false [2024-11-08 17:12:13,903 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3937 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_12| Int) (v_ArrVal_3950 (Array Int Int)) (v_ArrVal_3951 (Array Int Int)) (v_ArrVal_3940 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_10| Int) (v_ArrVal_3943 (Array Int Int)) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3944 (Array Int Int)) (v_ArrVal_3934 (Array Int Int)) (v_ArrVal_3945 (Array Int Int)) (v_ArrVal_3935 (Array Int Int)) (v_ArrVal_3936 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3950)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_3933))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_3936))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3938))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_3940))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3951) .cse9 v_ArrVal_3934) .cse10 v_ArrVal_3935) .cse11 v_ArrVal_3937) .cse12 v_ArrVal_3939))) (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~malloc57#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_3943)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_3944))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_3945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_12|) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_10|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_3944 .cse5))) v_ArrVal_3944)))))))))))))))) is different from false [2024-11-08 17:12:13,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886465610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:12:13,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:12:13,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 33 [2024-11-08 17:12:13,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988654359] [2024-11-08 17:12:13,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:12:13,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 17:12:13,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:13,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 17:12:13,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1024, Unknown=14, NotChecked=1078, Total=2256 [2024-11-08 17:12:13,915 INFO L87 Difference]: Start difference. First operand 1659 states and 2108 transitions. Second operand has 34 states, 31 states have (on average 5.741935483870968) internal successors, (178), 33 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 17:12:57,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:57,808 INFO L93 Difference]: Finished difference Result 1683 states and 2146 transitions. [2024-11-08 17:12:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 17:12:57,809 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 5.741935483870968) internal successors, (178), 33 states have internal predecessors, (178), 2 states have call successors, (2), 2 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 111 [2024-11-08 17:12:57,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:57,811 INFO L225 Difference]: With dead ends: 1683 [2024-11-08 17:12:57,811 INFO L226 Difference]: Without dead ends: 1683 [2024-11-08 17:12:57,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=258, Invalid=2040, Unknown=14, NotChecked=1470, Total=3782 [2024-11-08 17:12:57,812 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 1244 mSDsluCounter, 9792 mSDsCounter, 0 mSdLazyCounter, 7264 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 10562 SdHoareTripleChecker+Invalid, 7301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 7264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:57,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 10562 Invalid, 7301 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [37 Valid, 7264 Invalid, 0 Unknown, 0 Unchecked, 41.1s Time] [2024-11-08 17:12:57,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2024-11-08 17:12:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1658. [2024-11-08 17:12:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1286 states have (on average 1.6189735614307932) internal successors, (2082), 1644 states have internal predecessors, (2082), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-08 17:12:57,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2106 transitions. [2024-11-08 17:12:57,832 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2106 transitions. Word has length 111 [2024-11-08 17:12:57,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:57,832 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2106 transitions. [2024-11-08 17:12:57,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 5.741935483870968) internal successors, (178), 33 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 17:12:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2106 transitions. [2024-11-08 17:12:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 17:12:57,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:57,833 INFO L215 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] [2024-11-08 17:12:57,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-08 17:12:58,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:12:58,034 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:12:58,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:58,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2056131900, now seen corresponding path program 1 times [2024-11-08 17:12:58,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:58,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499063601] [2024-11-08 17:12:58,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:58,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:02,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:13:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:13:02,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:13:02,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499063601] [2024-11-08 17:13:02,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499063601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:13:02,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921886373] [2024-11-08 17:13:02,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:02,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:13:02,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:13:02,747 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:13:02,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 17:13:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:03,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-08 17:13:03,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:13:03,241 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-11-08 17:13:04,250 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:13:04,251 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-11-08 17:13:04,470 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-11-08 17:13:04,483 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-11-08 17:13:05,145 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:13:05,145 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-11-08 17:13:05,159 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-11-08 17:13:05,490 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:13:05,490 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-11-08 17:13:05,504 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-11-08 17:13:05,846 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:13:05,846 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-11-08 17:13:05,860 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-11-08 17:13:06,216 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:13:06,216 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-11-08 17:13:06,242 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-11-08 17:13:06,636 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:13:06,636 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-11-08 17:13:06,655 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-11-08 17:13:07,012 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-11-08 17:13:07,468 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-08 17:13:07,468 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-11-08 17:13:07,486 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-11-08 17:13:08,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:13:08,374 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-08 17:13:08,375 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-11-08 17:13:08,463 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-08 17:13:08,463 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-11-08 17:13:09,096 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-08 17:13:09,097 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-11-08 17:13:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:13:09,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:13:10,597 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base|)) (.cse1 (+ 40 |c_ULTIMATE.start_main_#t~mem58#1.offset|))) (and (forall ((v_ArrVal_4170 (Array Int Int))) (or (forall ((v_ArrVal_4169 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_4169 .cse1)) v_ArrVal_4169)) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4170)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4169))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (< (+ 383 (select (select .cse2 .cse3) .cse4)) (select |c_#length| (select (select .cse5 .cse3) .cse4))))))) (not (= v_ArrVal_4170 (store .cse7 .cse1 (select v_ArrVal_4170 .cse1)))))) (forall ((v_ArrVal_4170 (Array Int Int))) (or (not (= v_ArrVal_4170 (store .cse7 .cse1 (select v_ArrVal_4170 .cse1)))) (forall ((v_ArrVal_4169 (Array Int Int))) (or (< 0 (+ (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4170))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1)) (not (= (store .cse0 .cse1 (select v_ArrVal_4169 .cse1)) v_ArrVal_4169)))))))) is different from false [2024-11-08 17:13:10,795 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |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|) .cse5))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse7 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse9 (select |c_#memory_$Pointer$#1.offset| .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| .cse0) (forall ((v_ArrVal_4170 (Array Int Int))) (let ((.cse8 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (forall ((v_ArrVal_4169 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4170)) (.cse4 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_4169))) (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) 383) (select |c_#length| (select (select .cse4 .cse2) .cse3))))) (not (= v_ArrVal_4169 (store .cse7 .cse8 (select v_ArrVal_4169 .cse8)))))) (not (= v_ArrVal_4170 (store .cse9 .cse8 (select v_ArrVal_4170 .cse8))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| .cse0) (forall ((v_ArrVal_4170 (Array Int Int))) (let ((.cse10 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (forall ((v_ArrVal_4169 (Array Int Int))) (or (not (= v_ArrVal_4169 (store .cse7 .cse10 (select v_ArrVal_4169 .cse10)))) (< 0 (+ (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4170))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1)))) (not (= v_ArrVal_4170 (store .cse9 .cse10 (select v_ArrVal_4170 .cse10))))))))))))) is different from false [2024-11-08 17:13:16,015 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |c_ULTIMATE.start_main_#t~malloc57#1.base|))) (.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |c_ULTIMATE.start_main_#t~malloc57#1.offset|)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse0 (select .cse7 .cse5)) (.cse2 (select .cse4 .cse5))) (and (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (or (forall ((v_ArrVal_4170 (Array Int Int))) (let ((.cse1 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (not (= v_ArrVal_4170 (store .cse0 .cse1 (select v_ArrVal_4170 .cse1)))) (forall ((v_ArrVal_4169 (Array Int Int))) (or (not (= v_ArrVal_4169 (store .cse2 .cse1 (select v_ArrVal_4169 .cse1)))) (< 0 (+ 1 (let ((.cse3 (store .cse7 .cse5 v_ArrVal_4170))) (select (select .cse3 (select (select (store .cse4 .cse5 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))))))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| .cse8))) (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| .cse8) (forall ((v_ArrVal_4170 (Array Int Int))) (let ((.cse9 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (not (= v_ArrVal_4170 (store .cse0 .cse9 (select v_ArrVal_4170 .cse9)))) (forall ((v_ArrVal_4169 (Array Int Int))) (or (not (= v_ArrVal_4169 (store .cse2 .cse9 (select v_ArrVal_4169 .cse9)))) (let ((.cse10 (store .cse7 .cse5 v_ArrVal_4170)) (.cse13 (store .cse4 .cse5 v_ArrVal_4169))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse12 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (< (+ 383 (select (select .cse10 .cse11) .cse12)) (select |c_#length| (select (select .cse13 .cse11) .cse12)))))))))))))))) is different from false [2024-11-08 17:13:16,151 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 757 treesize of output 664 [2024-11-08 17:13:17,620 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| 0))) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base|))) (and (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_42 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse2 (+ 40 v_prenex_42))) (or (not (= v_prenex_41 (store (select .cse0 .cse1) .cse2 (select v_prenex_41 .cse2)))) (< 0 (+ (let ((.cse3 (store .cse0 .cse1 v_prenex_41))) (select (select .cse3 (select (select (store .cse4 .cse1 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1)) (not (= (store (select .cse4 .cse1) .cse2 (select v_prenex_40 .cse2)) v_prenex_40)) (< v_prenex_42 .cse6))))) (forall ((v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse9 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (not (= v_ArrVal_4170 (store (select .cse0 .cse8) .cse9 (select v_ArrVal_4170 .cse9)))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| .cse6) (< (let ((.cse10 (store .cse0 .cse8 v_ArrVal_4170))) (select (select .cse10 (select (select (store .cse11 .cse8 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1) (not (= v_ArrVal_4169 (store (select .cse11 .cse8) .cse9 (select v_ArrVal_4169 .cse9)))))))) (forall ((v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse13 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse12 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (not (= v_ArrVal_4170 (store (select .cse0 .cse12) .cse13 (select v_ArrVal_4170 .cse13)))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| .cse6) (not (= v_ArrVal_4169 (store (select .cse14 .cse12) .cse13 (select v_ArrVal_4169 .cse13)))) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_15| (select (let ((.cse15 (store .cse14 .cse12 v_ArrVal_4169))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (select (select (store .cse0 .cse12 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))) is different from false [2024-11-08 17:13:20,358 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4163)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4164))) (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 ((.cse4 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse3 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse0 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse0 .cse2) .cse3 (select v_ArrVal_4170 .cse3)) v_ArrVal_4170)) (not (= (store (select .cse4 .cse2) .cse3 (select v_ArrVal_4169 .cse3)) v_ArrVal_4169)) (= (select (let ((.cse5 (store .cse4 .cse2 v_ArrVal_4169))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse2 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4163)) (.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4164))) (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 ((.cse12 (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse10 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 0))) (.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse14 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse11 (store .cse10 .cse13 v_ArrVal_4170))) (select (select .cse11 (select (select (store .cse12 .cse13 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= (store (select .cse10 .cse13) .cse14 (select v_ArrVal_4170 .cse14)) v_ArrVal_4170)) (not (= (store (select .cse12 .cse13) .cse14 (select v_ArrVal_4169 .cse14)) v_ArrVal_4169)))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_42 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int)) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4163)) (.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4164))) (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~malloc57#1.base_15|)))) (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_prenex_42))) (or (< v_prenex_42 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse20 .cse21) .cse22 (select v_prenex_40 .cse22)) v_prenex_40)) (< 0 (+ (let ((.cse23 (store .cse19 .cse21 v_prenex_41))) (select (select .cse23 (select (select (store .cse20 .cse21 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= (store (select .cse19 .cse21) .cse22 (select v_prenex_41 .cse22)) v_prenex_41)))))))))) is different from false [2024-11-08 17:13:21,218 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4163)) (.cse9 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4164))) (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 ((.cse3 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse0 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_15| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4169))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4169 (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4169 .cse5)))) (not (= v_ArrVal_4170 (store (select (store .cse6 .cse7 (store v_ArrVal_4163 .cse8 0)) .cse4) .cse5 (select v_ArrVal_4170 .cse5)))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_42 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int)) (let ((.cse20 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4163)) (.cse12 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4164))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse14 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse15 (+ 40 v_prenex_42)) (.cse17 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse16 (store .cse20 .cse13 (store (select .cse20 .cse13) .cse14 0)))) (or (not (= v_prenex_40 (store (let ((.cse11 (store .cse12 .cse13 (store v_ArrVal_4164 .cse14 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse15 (select v_prenex_40 .cse15)))) (not (= (store (select .cse16 .cse17) .cse15 (select v_prenex_41 .cse15)) v_prenex_41)) (< 0 (+ (let ((.cse18 (store .cse16 .cse17 v_prenex_41))) (select (select .cse18 (select (select (store .cse19 .cse17 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< v_prenex_42 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse30 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4163)) (.cse23 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4164))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse25 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse28 (store .cse23 .cse24 (store (select .cse23 .cse24) .cse25 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse21 (store .cse30 .cse24 (store (select .cse30 .cse24) .cse25 0))) (.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse26 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (let ((.cse22 (store .cse23 .cse24 (store v_ArrVal_4164 .cse25 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse26 (select v_ArrVal_4169 .cse26)) v_ArrVal_4169)) (< (let ((.cse27 (store .cse21 .cse29 v_ArrVal_4170))) (select (select .cse27 (select (select (store .cse28 .cse29 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4170 (store (select .cse21 .cse29) .cse26 (select v_ArrVal_4170 .cse26))))))))))))) is different from false [2024-11-08 17:13:22,711 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_42 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4162))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4161) .cse12 v_ArrVal_4163)) (.cse5 (store .cse11 .cse12 v_ArrVal_4164))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse2 (+ 40 v_prenex_42)) (.cse0 (store .cse10 .cse6 (store (select .cse10 .cse6) .cse7 0))) (.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_prenex_41 .cse2)) v_prenex_41)) (< v_prenex_42 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_prenex_40 (store (let ((.cse4 (store .cse5 .cse6 (store v_ArrVal_4164 .cse7 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse2 (select v_prenex_40 .cse2)))) (< 0 (+ (let ((.cse8 (store .cse0 .cse1 v_prenex_41))) (select (select .cse8 (select (select (store .cse9 .cse1 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1)))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4162))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse22 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4161) .cse24 v_ArrVal_4163)) (.cse14 (store .cse23 .cse24 v_ArrVal_4164))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse16 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse21 (store .cse14 .cse15 (store (select .cse14 .cse15) .cse16 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse17 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse18 (store .cse22 .cse15 (store (select .cse22 .cse15) .cse16 0))) (.cse19 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (not (= v_ArrVal_4169 (store (let ((.cse13 (store .cse14 .cse15 (store v_ArrVal_4164 .cse16 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse17 (select v_ArrVal_4169 .cse17)))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (select .cse18 .cse19) .cse17 (select v_ArrVal_4170 .cse17)) v_ArrVal_4170)) (< (let ((.cse20 (store .cse18 .cse19 v_ArrVal_4170))) (select (select .cse20 (select (select (store .cse21 .cse19 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4162))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse30 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4161) .cse35 v_ArrVal_4163)) (.cse33 (store .cse34 .cse35 v_ArrVal_4164))) (let ((.cse31 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse32 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse26 (store .cse33 .cse31 (store (select .cse33 .cse31) .cse32 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse25 (store .cse30 .cse31 (store (select .cse30 .cse31) .cse32 0))) (.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse28 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (select .cse26 .cse27) .cse28 (select v_ArrVal_4169 .cse28)) v_ArrVal_4169)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_15| (select (let ((.cse29 (store .cse26 .cse27 v_ArrVal_4169))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse25 .cse27 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (not (= (store (select (store .cse30 .cse31 (store v_ArrVal_4163 .cse32 0)) .cse27) .cse28 (select v_ArrVal_4170 .cse28)) v_ArrVal_4170)))))))))))) is different from false [2024-11-08 17:13:23,408 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_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_42 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4162))) (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_4161) .cse12 v_ArrVal_4163)) (.cse2 (store .cse11 .cse12 v_ArrVal_4164))) (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 ((.cse7 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse9 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0))) (.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 v_prenex_42))) (or (not (= v_prenex_40 (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4164 .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_40 .cse5)))) (< 0 (+ (let ((.cse6 (store .cse9 .cse8 v_prenex_41))) (select (select .cse6 (select (select (store .cse7 .cse8 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< v_prenex_42 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_41 (store (select .cse9 .cse8) .cse5 (select v_prenex_41 .cse5)))))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4162))) (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_4161) .cse25 v_ArrVal_4163)) (.cse20 (store .cse24 .cse25 v_ArrVal_4164))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse17 (store .cse23 .cse21 (store (select .cse23 .cse21) .cse22 0))) (.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (< (let ((.cse14 (store .cse17 .cse16 v_ArrVal_4170))) (select (select .cse14 (select (select (store .cse15 .cse16 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse17 .cse16) .cse18 (select v_ArrVal_4170 .cse18)) v_ArrVal_4170)) (not (= (store (let ((.cse19 (store .cse20 .cse21 (store v_ArrVal_4164 .cse22 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse18 (select v_ArrVal_4169 .cse18)) v_ArrVal_4169)))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4162))) (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_4161) .cse36 v_ArrVal_4163)) (.cse34 (store .cse35 .cse36 v_ArrVal_4164))) (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 ((.cse27 (store .cse34 .cse32 (store (select .cse34 .cse32) .cse33 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse29 (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 0))) (.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse30 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (= (select (let ((.cse26 (store .cse27 .cse28 v_ArrVal_4169))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse29 .cse28 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|) (not (= (store (select .cse27 .cse28) .cse30 (select v_ArrVal_4169 .cse30)) v_ArrVal_4169)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select (store .cse31 .cse32 (store v_ArrVal_4163 .cse33 0)) .cse28) .cse30 (select v_ArrVal_4170 .cse30)) v_ArrVal_4170))))))))))))) is different from false [2024-11-08 17:13:24,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4159))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_4162))) (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~mem53#1.base| v_ArrVal_4160) .cse13 v_ArrVal_4161) .cse12 v_ArrVal_4163)) (.cse2 (store .cse11 .cse12 v_ArrVal_4164))) (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 ((.cse7 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse9 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0))) (.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (not (= (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4164 .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4169 .cse5)) v_ArrVal_4169)) (< (let ((.cse6 (store .cse9 .cse8 v_ArrVal_4170))) (select (select .cse6 (select (select (store .cse7 .cse8 v_ArrVal_4169) |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~mem58#1.offset_13| (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4170 (store (select .cse9 .cse8) .cse5 (select v_ArrVal_4170 .cse5)))))))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4159))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store .cse27 .cse26 v_ArrVal_4162))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4160) .cse26 v_ArrVal_4161) .cse25 v_ArrVal_4163)) (.cse23 (store .cse24 .cse25 v_ArrVal_4164))) (let ((.cse21 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse23 .cse21 (store (select .cse23 .cse21) .cse22 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse19 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse18 (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 0)))) (or (= (select (let ((.cse15 (store .cse16 .cse17 v_ArrVal_4169))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse18 .cse17 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|) (not (= v_ArrVal_4169 (store (select .cse16 .cse17) .cse19 (select v_ArrVal_4169 .cse19)))) (not (= (store (select (store .cse20 .cse21 (store v_ArrVal_4163 .cse22 0)) .cse17) .cse19 (select v_ArrVal_4170 .cse19)) v_ArrVal_4170)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_42 Int) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4159))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store .cse41 .cse40 v_ArrVal_4162))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse37 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4160) .cse40 v_ArrVal_4161) .cse39 v_ArrVal_4163)) (.cse34 (store .cse38 .cse39 v_ArrVal_4164))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse36 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse32 (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse28 (store .cse37 .cse35 (store (select .cse37 .cse35) .cse36 0))) (.cse30 (+ 40 v_prenex_42))) (or (not (= v_prenex_41 (store (select .cse28 .cse29) .cse30 (select v_prenex_41 .cse30)))) (< 0 (+ (let ((.cse31 (store .cse28 .cse29 v_prenex_41))) (select (select .cse31 (select (select (store .cse32 .cse29 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< v_prenex_42 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_40 (store (let ((.cse33 (store .cse34 .cse35 (store v_ArrVal_4164 .cse36 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse30 (select v_prenex_40 .cse30)))))))))))))))) is different from false [2024-11-08 17:13:25,518 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (and (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4159))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_4162))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4160) .cse13 v_ArrVal_4161) .cse11 v_ArrVal_4163)) (.cse9 (store .cse10 .cse11 v_ArrVal_4164))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse5 (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse6 (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0))) (.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (or (not (= v_ArrVal_4170 (store (select (store .cse0 .cse1 (store v_ArrVal_4163 .cse2 0)) .cse3) .cse4 (select v_ArrVal_4170 .cse4)))) (not (= v_ArrVal_4169 (store (select .cse5 .cse3) .cse4 (select v_ArrVal_4169 .cse4)))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_15| (select (let ((.cse8 (store .cse5 .cse3 v_ArrVal_4169))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (select (select (store .cse6 .cse3 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))))))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4159))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse25 (store .cse28 .cse27 v_ArrVal_4162))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4160) .cse27 v_ArrVal_4161) .cse26 v_ArrVal_4163)) (.cse21 (store .cse25 .cse26 v_ArrVal_4164))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse23 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse19 (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse16 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse15 (store .cse24 .cse22 (store (select .cse24 .cse22) .cse23 0))) (.cse17 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (not (= (store (select .cse15 .cse16) .cse17 (select v_ArrVal_4170 .cse17)) v_ArrVal_4170)) (< (let ((.cse18 (store .cse15 .cse16 v_ArrVal_4170))) (select (select .cse18 (select (select (store .cse19 .cse16 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) 1) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (not (= v_ArrVal_4169 (store (let ((.cse20 (store .cse21 .cse22 (store v_ArrVal_4164 .cse23 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) .cse17 (select v_ArrVal_4169 .cse17)))))))))))))) (forall ((v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_42 Int) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4159))) (let ((.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse39 (store .cse42 .cse41 v_ArrVal_4162))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse38 (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4160) .cse41 v_ArrVal_4161) .cse40 v_ArrVal_4163)) (.cse30 (store .cse39 .cse40 v_ArrVal_4164))) (let ((.cse31 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse32 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse35 (store .cse30 .cse31 (store (select .cse30 .cse31) .cse32 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse37 (store .cse38 .cse31 (store (select .cse38 .cse31) .cse32 0))) (.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse33 (+ 40 v_prenex_42))) (or (not (= v_prenex_40 (store (let ((.cse29 (store .cse30 .cse31 (store v_ArrVal_4164 .cse32 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) .cse33 (select v_prenex_40 .cse33)))) (< 0 (+ (let ((.cse34 (store .cse37 .cse36 v_prenex_41))) (select (select .cse34 (select (select (store .cse35 .cse36 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) 1)) (< v_prenex_42 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (not (= v_prenex_41 (store (select .cse37 .cse36) .cse33 (select v_prenex_41 .cse33))))))))))))))))) is different from false [2024-11-08 17:13:28,232 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4158))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_4159))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse15 .cse14 v_ArrVal_4162))) (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~mem52#1.base| v_ArrVal_4157) .cse13 v_ArrVal_4160) .cse14 v_ArrVal_4161) .cse12 v_ArrVal_4163)) (.cse2 (store .cse11 .cse12 v_ArrVal_4164))) (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 ((.cse9 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse6 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0))) (.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4164 .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4169 .cse5)) v_ArrVal_4169)) (not (= v_ArrVal_4170 (store (select .cse6 .cse7) .cse5 (select v_ArrVal_4170 .cse5)))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse8 (store .cse6 .cse7 v_ArrVal_4170))) (select (select .cse8 (select (select (store .cse9 .cse7 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1))))))))))))) (forall ((v_prenex_42 Int) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4158))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_4159))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_4162))) (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~mem52#1.base| v_ArrVal_4157) .cse29 v_ArrVal_4160) .cse30 v_ArrVal_4161) .cse28 v_ArrVal_4163)) (.cse23 (store .cse27 .cse28 v_ArrVal_4164))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse25 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store .cse23 .cse24 (store (select .cse23 .cse24) .cse25 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse17 (store .cse26 .cse24 (store (select .cse26 .cse24) .cse25 0))) (.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse21 (+ 40 v_prenex_42))) (or (< v_prenex_42 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse18 (store .cse17 .cse20 v_prenex_41))) (select (select .cse18 (select (select (store .cse19 .cse20 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= (store (select .cse17 .cse20) .cse21 (select v_prenex_41 .cse21)) v_prenex_41)) (not (= v_prenex_40 (store (let ((.cse22 (store .cse23 .cse24 (store v_ArrVal_4164 .cse25 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse21 (select v_prenex_40 .cse21)))))))))))))))) (forall ((v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse47 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4158))) (let ((.cse44 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse46 (store .cse47 .cse44 v_ArrVal_4159))) (let ((.cse45 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse42 (store .cse46 .cse45 v_ArrVal_4162))) (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~mem52#1.base| v_ArrVal_4157) .cse44 v_ArrVal_4160) .cse45 v_ArrVal_4161) .cse43 v_ArrVal_4163)) (.cse41 (store .cse42 .cse43 v_ArrVal_4164))) (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 ((.cse34 (store .cse41 .cse39 (store (select .cse41 .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse36 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 0))) (.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse37 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_15| (select (let ((.cse33 (store .cse34 .cse35 v_ArrVal_4169))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse36 .cse35 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4169 (store (select .cse34 .cse35) .cse37 (select v_ArrVal_4169 .cse37)))) (not (= v_ArrVal_4170 (store (select (store .cse38 .cse39 (store v_ArrVal_4163 .cse40 0)) .cse35) .cse37 (select v_ArrVal_4170 .cse37)))))))))))))))))) is different from false [2024-11-08 17:13:31,067 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4158))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_4159))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse15 .cse14 v_ArrVal_4162))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4157) .cse13 v_ArrVal_4160) .cse14 v_ArrVal_4161) .cse11 v_ArrVal_4163)) (.cse9 (store .cse10 .cse11 v_ArrVal_4164))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 0))) (.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select (store .cse2 .cse3 (store v_ArrVal_4163 .cse4 0)) .cse5) .cse6 (select v_ArrVal_4170 .cse6)) v_ArrVal_4170)) (= (select (let ((.cse7 (store .cse8 .cse5 v_ArrVal_4169))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse5 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|) (not (= v_ArrVal_4169 (store (select .cse8 .cse5) .cse6 (select v_ArrVal_4169 .cse6)))))))))))))))) (forall ((v_prenex_42 Int) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4158))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_4159))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_4162))) (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| .cse12 v_ArrVal_4157) .cse29 v_ArrVal_4160) .cse30 v_ArrVal_4161) .cse28 v_ArrVal_4163)) (.cse22 (store .cse27 .cse28 v_ArrVal_4164))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse24 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse18 (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse25 (+ 40 v_prenex_42)) (.cse20 (store .cse26 .cse23 (store (select .cse26 .cse23) .cse24 0)))) (or (< 0 (+ (let ((.cse17 (store .cse20 .cse19 v_prenex_41))) (select (select .cse17 (select (select (store .cse18 .cse19 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= (store (let ((.cse21 (store .cse22 .cse23 (store v_ArrVal_4164 .cse24 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse25 (select v_prenex_40 .cse25)) v_prenex_40)) (not (= (store (select .cse20 .cse19) .cse25 (select v_prenex_41 .cse25)) v_prenex_41)) (< v_prenex_42 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) (forall ((v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse48 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4158))) (let ((.cse45 (select (select .cse48 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse47 (store .cse48 .cse45 v_ArrVal_4159))) (let ((.cse46 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse43 (store .cse47 .cse46 v_ArrVal_4162))) (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| .cse12 v_ArrVal_4157) .cse45 v_ArrVal_4160) .cse46 v_ArrVal_4161) .cse44 v_ArrVal_4163)) (.cse39 (store .cse43 .cse44 v_ArrVal_4164))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse37 (store .cse39 .cse40 (store (select .cse39 .cse40) .cse41 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse34 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse35 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse33 (store .cse42 .cse40 (store (select .cse42 .cse40) .cse41 0)))) (or (not (= v_ArrVal_4170 (store (select .cse33 .cse34) .cse35 (select v_ArrVal_4170 .cse35)))) (< (let ((.cse36 (store .cse33 .cse34 v_ArrVal_4170))) (select (select .cse36 (select (select (store .cse37 .cse34 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= (store (let ((.cse38 (store .cse39 .cse40 (store v_ArrVal_4164 .cse41 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse38 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse35 (select v_ArrVal_4169 .cse35)) v_ArrVal_4169)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))))) is different from false [2024-11-08 17:13:33,112 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4175 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4176 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4176))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_4158))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_4159))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_4162))) (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~mem50#1.base| v_ArrVal_4175) .cse13 v_ArrVal_4157) .cse14 v_ArrVal_4160) .cse15 v_ArrVal_4161) .cse12 v_ArrVal_4163)) (.cse2 (store .cse11 .cse12 v_ArrVal_4164))) (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 ((.cse7 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse9 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0)))) (or (not (= v_ArrVal_4169 (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4164 .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4169 .cse5)))) (< (let ((.cse6 (store .cse9 .cse8 v_ArrVal_4170))) (select (select .cse6 (select (select (store .cse7 .cse8 v_ArrVal_4169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4170 (store (select .cse9 .cse8) .cse5 (select v_ArrVal_4170 .cse5)))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) (forall ((v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4175 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4176 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4169 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4176))) (let ((.cse30 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store .cse35 .cse30 v_ArrVal_4158))) (let ((.cse31 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store .cse34 .cse31 v_ArrVal_4159))) (let ((.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse28 (store .cse33 .cse32 v_ArrVal_4162))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4175) .cse30 v_ArrVal_4157) .cse31 v_ArrVal_4160) .cse32 v_ArrVal_4161) .cse29 v_ArrVal_4163)) (.cse27 (store .cse28 .cse29 v_ArrVal_4164))) (let ((.cse20 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse21 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store .cse27 .cse20 (store (select .cse27 .cse20) .cse21 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse23 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|)) (.cse25 (store .cse19 .cse20 (store (select .cse19 .cse20) .cse21 0))) (.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= (store (select (store .cse19 .cse20 (store v_ArrVal_4163 .cse21 0)) .cse22) .cse23 (select v_ArrVal_4170 .cse23)) v_ArrVal_4170)) (not (= v_ArrVal_4169 (store (select .cse24 .cse22) .cse23 (select v_ArrVal_4169 .cse23)))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (select (let ((.cse26 (store .cse24 .cse22 v_ArrVal_4169))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse25 .cse22 v_ArrVal_4170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|))))))))))))))) (forall ((v_prenex_42 Int) (v_ArrVal_4160 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4162 (Array Int Int)) (v_ArrVal_4163 (Array Int Int)) (v_ArrVal_4175 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4176 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse53 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4176))) (let ((.cse48 (select (select .cse53 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse52 (store .cse53 .cse48 v_ArrVal_4158))) (let ((.cse49 (select (select .cse52 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse51 (store .cse52 .cse49 v_ArrVal_4159))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse46 (store .cse51 .cse50 v_ArrVal_4162))) (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~mem50#1.base| v_ArrVal_4175) .cse48 v_ArrVal_4157) .cse49 v_ArrVal_4160) .cse50 v_ArrVal_4161) .cse47 v_ArrVal_4163)) (.cse38 (store .cse46 .cse47 v_ArrVal_4164))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse40 (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse43 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse36 (store .cse45 .cse39 (store (select .cse45 .cse39) .cse40 0))) (.cse44 (select (select .cse43 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse41 (+ 40 v_prenex_42))) (or (< v_prenex_42 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_40 (store (let ((.cse37 (store .cse38 .cse39 (store v_ArrVal_4164 .cse40 |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse41 (select v_prenex_40 .cse41)))) (< 0 (+ (let ((.cse42 (store .cse36 .cse44 v_prenex_41))) (select (select .cse42 (select (select (store .cse43 .cse44 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= (store (select .cse36 .cse44) .cse41 (select v_prenex_41 .cse41)) v_prenex_41)))))))))))))))))) is different from false [2024-11-08 17:13:33,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921886373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:13:33,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:13:33,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 34 [2024-11-08 17:13:33,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175491572] [2024-11-08 17:13:33,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:13:33,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-08 17:13:33,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:13:33,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-08 17:13:33,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1347, Unknown=13, NotChecked=1118, Total=2652 [2024-11-08 17:13:33,424 INFO L87 Difference]: Start difference. First operand 1658 states and 2106 transitions. Second operand has 35 states, 32 states have (on average 5.59375) internal successors, (179), 34 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 17:14:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:53,823 INFO L93 Difference]: Finished difference Result 1682 states and 2144 transitions. [2024-11-08 17:14:53,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 17:14:53,823 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 5.59375) internal successors, (179), 34 states have internal predecessors, (179), 2 states have call successors, (2), 2 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 111 [2024-11-08 17:14:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:53,826 INFO L225 Difference]: With dead ends: 1682 [2024-11-08 17:14:53,826 INFO L226 Difference]: Without dead ends: 1682 [2024-11-08 17:14:53,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=313, Invalid=2482, Unknown=13, NotChecked=1482, Total=4290 [2024-11-08 17:14:53,828 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 1233 mSDsluCounter, 11583 mSDsCounter, 0 mSdLazyCounter, 10441 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 12350 SdHoareTripleChecker+Invalid, 10476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 10441 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 76.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:53,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 12350 Invalid, 10476 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 10441 Invalid, 2 Unknown, 0 Unchecked, 76.1s Time] [2024-11-08 17:14:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2024-11-08 17:14:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1602. [2024-11-08 17:14:53,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1232 states have (on average 1.6452922077922079) internal successors, (2027), 1590 states have internal predecessors, (2027), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:14:53,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2045 transitions. [2024-11-08 17:14:53,851 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2045 transitions. Word has length 111 [2024-11-08 17:14:53,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:53,851 INFO L471 AbstractCegarLoop]: Abstraction has 1602 states and 2045 transitions. [2024-11-08 17:14:53,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 5.59375) internal successors, (179), 34 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 17:14:53,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2045 transitions. [2024-11-08 17:14:53,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 17:14:53,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:53,853 INFO L215 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] [2024-11-08 17:14:53,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-08 17:14:54,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-08 17:14:54,054 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr133REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:14:54,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:54,054 INFO L85 PathProgramCache]: Analyzing trace with hash 439612628, now seen corresponding path program 1 times [2024-11-08 17:14:54,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:14:54,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121075083] [2024-11-08 17:14:54,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:54,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:14:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:54,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:14:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:54,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 17:14:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 17:14:54,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:14:54,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121075083] [2024-11-08 17:14:54,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121075083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:14:54,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:14:54,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:14:54,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129815749] [2024-11-08 17:14:54,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:14:54,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:14:54,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:14:54,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:14:54,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:14:54,395 INFO L87 Difference]: Start difference. First operand 1602 states and 2045 transitions. Second operand has 5 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-11-08 17:15:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:05,882 INFO L93 Difference]: Finished difference Result 2469 states and 3161 transitions. [2024-11-08 17:15:05,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:15:05,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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 120 [2024-11-08 17:15:05,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:05,885 INFO L225 Difference]: With dead ends: 2469 [2024-11-08 17:15:05,885 INFO L226 Difference]: Without dead ends: 2469 [2024-11-08 17:15:05,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-11-08 17:15:05,886 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 2887 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2895 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:05,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2895 Valid, 2363 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2024-11-08 17:15:05,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2024-11-08 17:15:05,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2166. [2024-11-08 17:15:05,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2166 states, 1803 states have (on average 1.625069328896284) internal successors, (2930), 2152 states have internal predecessors, (2930), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 17:15:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 2952 transitions. [2024-11-08 17:15:05,909 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 2952 transitions. Word has length 120 [2024-11-08 17:15:05,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:05,910 INFO L471 AbstractCegarLoop]: Abstraction has 2166 states and 2952 transitions. [2024-11-08 17:15:05,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-11-08 17:15:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2952 transitions. [2024-11-08 17:15:05,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 17:15:05,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:05,911 INFO L215 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] [2024-11-08 17:15:05,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-08 17:15:05,911 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr134REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:15:05,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:05,911 INFO L85 PathProgramCache]: Analyzing trace with hash 439612629, now seen corresponding path program 1 times [2024-11-08 17:15:05,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:05,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44226014] [2024-11-08 17:15:05,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:05,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:06,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:15:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:06,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 17:15:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 17:15:06,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:06,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44226014] [2024-11-08 17:15:06,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44226014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:06,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:06,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:15:06,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299958693] [2024-11-08 17:15:06,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:06,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:15:06,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:06,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:15:06,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:15:06,399 INFO L87 Difference]: Start difference. First operand 2166 states and 2952 transitions. Second operand has 6 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-11-08 17:15:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:18,686 INFO L93 Difference]: Finished difference Result 2817 states and 3732 transitions. [2024-11-08 17:15:18,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:15:18,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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 120 [2024-11-08 17:15:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:18,690 INFO L225 Difference]: With dead ends: 2817 [2024-11-08 17:15:18,690 INFO L226 Difference]: Without dead ends: 2817 [2024-11-08 17:15:18,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:18,691 INFO L432 NwaCegarLoop]: 883 mSDtfsCounter, 4173 mSDsluCounter, 1641 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4183 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:18,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4183 Valid, 2524 Invalid, 1568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2024-11-08 17:15:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2024-11-08 17:15:18,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2618. [2024-11-08 17:15:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2255 states have (on average 1.6186252771618626) internal successors, (3650), 2602 states have internal predecessors, (3650), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 17:15:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 3676 transitions. [2024-11-08 17:15:18,719 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 3676 transitions. Word has length 120 [2024-11-08 17:15:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:18,719 INFO L471 AbstractCegarLoop]: Abstraction has 2618 states and 3676 transitions. [2024-11-08 17:15:18,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-11-08 17:15:18,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 3676 transitions. [2024-11-08 17:15:18,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 17:15:18,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:18,721 INFO L215 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] [2024-11-08 17:15:18,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-08 17:15:18,721 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:15:18,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:18,722 INFO L85 PathProgramCache]: Analyzing trace with hash 743090329, now seen corresponding path program 1 times [2024-11-08 17:15:18,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:18,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785891131] [2024-11-08 17:15:18,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:18,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:18,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:15:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:19,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 17:15:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 17:15:19,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785891131] [2024-11-08 17:15:19,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785891131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:15:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364579238] [2024-11-08 17:15:19,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:19,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:15:19,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:15:19,261 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:15:19,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 17:15:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:19,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-08 17:15:19,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:15:19,798 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-11-08 17:15:20,961 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:15:20,961 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-11-08 17:15:21,082 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-11-08 17:15:21,911 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:15:21,911 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-11-08 17:15:22,246 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:15:22,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 31 treesize of output 32 [2024-11-08 17:15:22,607 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:15:22,607 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-11-08 17:15:23,022 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:15:23,023 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-11-08 17:15:23,459 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:15:23,459 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-11-08 17:15:24,126 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:15:24,127 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-11-08 17:15:24,369 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-11-08 17:15:25,325 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-11-08 17:15:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:25,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:15:25,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364579238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:25,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:15:25,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [5] total 20 [2024-11-08 17:15:25,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326827515] [2024-11-08 17:15:25,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:25,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 17:15:25,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:25,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 17:15:25,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:15:25,577 INFO L87 Difference]: Start difference. First operand 2618 states and 3676 transitions. Second operand has 17 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 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-11-08 17:16:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:08,709 INFO L93 Difference]: Finished difference Result 2693 states and 3768 transitions. [2024-11-08 17:16:08,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:16:08,710 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 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 121 [2024-11-08 17:16:08,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:08,713 INFO L225 Difference]: With dead ends: 2693 [2024-11-08 17:16:08,713 INFO L226 Difference]: Without dead ends: 2693 [2024-11-08 17:16:08,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 17:16:08,714 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 1183 mSDsluCounter, 7489 mSDsCounter, 0 mSdLazyCounter, 5547 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 8252 SdHoareTripleChecker+Invalid, 5581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 5547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:08,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 8252 Invalid, 5581 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 5547 Invalid, 0 Unknown, 0 Unchecked, 40.8s Time] [2024-11-08 17:16:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2024-11-08 17:16:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2687. [2024-11-08 17:16:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2687 states, 2321 states have (on average 1.6014648858250753) internal successors, (3717), 2667 states have internal predecessors, (3717), 15 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (30), 17 states have call predecessors, (30), 15 states have call successors, (30) [2024-11-08 17:16:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3762 transitions. [2024-11-08 17:16:08,752 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 3762 transitions. Word has length 121 [2024-11-08 17:16:08,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:08,752 INFO L471 AbstractCegarLoop]: Abstraction has 2687 states and 3762 transitions. [2024-11-08 17:16:08,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 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-11-08 17:16:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3762 transitions. [2024-11-08 17:16:08,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 17:16:08,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:08,754 INFO L215 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] [2024-11-08 17:16:08,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-08 17:16:08,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2024-11-08 17:16:08,955 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:16:08,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:08,955 INFO L85 PathProgramCache]: Analyzing trace with hash 743090330, now seen corresponding path program 1 times [2024-11-08 17:16:08,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:08,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802817997] [2024-11-08 17:16:08,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:08,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:09,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:16:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:09,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 17:16:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 17:16:09,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:09,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802817997] [2024-11-08 17:16:09,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802817997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:09,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142213706] [2024-11-08 17:16:09,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:09,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:09,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:16:09,640 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:16:09,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-08 17:16:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:10,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-08 17:16:10,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:16:10,216 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-11-08 17:16:11,387 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:16:11,387 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-11-08 17:16:11,521 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-11-08 17:16:11,552 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-11-08 17:16:12,573 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:12,573 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-11-08 17:16:12,614 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-11-08 17:16:13,038 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:13,039 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-11-08 17:16:13,061 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-11-08 17:16:13,472 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:13,472 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-11-08 17:16:13,492 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-11-08 17:16:13,888 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:13,889 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-11-08 17:16:13,913 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-11-08 17:16:14,369 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:14,369 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-11-08 17:16:14,400 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-11-08 17:16:14,860 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:14,860 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-11-08 17:16:14,884 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-11-08 17:16:15,540 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-11-08 17:16:15,556 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-11-08 17:16:16,660 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-11-08 17:16:16,676 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-11-08 17:16:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:16:16,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:16:16,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142213706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:16,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:16:16,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [5] total 20 [2024-11-08 17:16:16,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789638129] [2024-11-08 17:16:16,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:16,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 17:16:16,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:16,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 17:16:16,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:16:16,897 INFO L87 Difference]: Start difference. First operand 2687 states and 3762 transitions. Second operand has 17 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 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-11-08 17:16:49,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:49,324 INFO L93 Difference]: Finished difference Result 2696 states and 3769 transitions. [2024-11-08 17:16:49,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:16:49,324 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 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 121 [2024-11-08 17:16:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:49,327 INFO L225 Difference]: With dead ends: 2696 [2024-11-08 17:16:49,327 INFO L226 Difference]: Without dead ends: 2696 [2024-11-08 17:16:49,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2024-11-08 17:16:49,328 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 1173 mSDsluCounter, 4115 mSDsCounter, 0 mSdLazyCounter, 4145 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 4888 SdHoareTripleChecker+Invalid, 4166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:49,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 4888 Invalid, 4166 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 4145 Invalid, 0 Unknown, 0 Unchecked, 30.0s Time] [2024-11-08 17:16:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2024-11-08 17:16:49,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2696. [2024-11-08 17:16:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2696 states, 2329 states have (on average 1.5989695148132246) internal successors, (3724), 2675 states have internal predecessors, (3724), 15 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (30), 17 states have call predecessors, (30), 15 states have call successors, (30) [2024-11-08 17:16:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 3769 transitions. [2024-11-08 17:16:49,352 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 3769 transitions. Word has length 121 [2024-11-08 17:16:49,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:49,352 INFO L471 AbstractCegarLoop]: Abstraction has 2696 states and 3769 transitions. [2024-11-08 17:16:49,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 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-11-08 17:16:49,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3769 transitions. [2024-11-08 17:16:49,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:16:49,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:49,354 INFO L215 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] [2024-11-08 17:16:49,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-08 17:16:49,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-11-08 17:16:49,554 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-08 17:16:49,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:49,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1851582984, now seen corresponding path program 1 times [2024-11-08 17:16:49,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:49,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84808165] [2024-11-08 17:16:49,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:49,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:49,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:16:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:50,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:16:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 17:16:50,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:50,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84808165] [2024-11-08 17:16:50,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84808165] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:50,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211830408] [2024-11-08 17:16:50,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:50,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:50,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:16:50,317 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:16:50,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92d1713-ff04-4aa4-82cc-65052ed19044/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-08 17:16:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:50,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-08 17:16:50,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:16:50,840 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-11-08 17:16:52,064 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:16:52,064 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-11-08 17:16:52,192 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-11-08 17:16:53,092 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:53,093 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-11-08 17:16:53,423 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:53,424 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-11-08 17:16:53,747 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:53,748 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-11-08 17:16:54,091 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:54,091 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-11-08 17:16:54,444 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:54,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 31 treesize of output 32 [2024-11-08 17:16:54,832 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:54,832 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-11-08 17:16:55,534 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:55,534 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-11-08 17:16:55,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 22 treesize of output 10 [2024-11-08 17:16:56,753 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-11-08 17:16:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:16:56,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:16:58,738 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4951 (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_4951) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-08 17:16:58,832 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-08 17:16:58,832 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-11-08 17:16:59,330 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4950 (Array Int Int)) (v_ArrVal_4951 (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_4950))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4951)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-08 17:16:59,841 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4949 (Array Int Int)) (v_ArrVal_4950 (Array Int Int)) (v_ArrVal_4951 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4949))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_4950))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4951)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-08 17:16:59,897 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4949 (Array Int Int)) (v_ArrVal_4950 (Array Int Int)) (v_ArrVal_4951 (Array Int Int)) (v_ArrVal_4948 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4948))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4949)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_4950))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4951)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-08 17:16:59,935 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4949 (Array Int Int)) (v_ArrVal_4950 (Array Int Int)) (v_ArrVal_4951 (Array Int Int)) (v_ArrVal_4948 (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_4948))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4949)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4950))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4951)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 17:16:59,995 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4949 (Array Int Int)) (v_ArrVal_4950 (Array Int Int)) (v_ArrVal_4951 (Array Int Int)) (v_ArrVal_4947 (Array Int Int)) (v_ArrVal_4948 (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~mem53#1.base| v_ArrVal_4947))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4948)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4949)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4950))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4951)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 17:17:00,038 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4949 (Array Int Int)) (v_ArrVal_4950 (Array Int Int)) (v_ArrVal_4951 (Array Int Int)) (v_ArrVal_4947 (Array Int Int)) (v_ArrVal_4948 (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_4947))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4948)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4949)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4950))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4951)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 17:17:00,121 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4949 (Array Int Int)) (v_ArrVal_4950 (Array Int Int)) (v_ArrVal_4951 (Array Int Int)) (v_ArrVal_4946 (Array Int Int)) (v_ArrVal_4947 (Array Int Int)) (v_ArrVal_4948 (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~mem52#1.base| v_ArrVal_4946))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4947)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4948)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4949)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4950))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4951)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 17:17:00,204 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4949 (Array Int Int)) (v_ArrVal_4950 (Array Int Int)) (v_ArrVal_4951 (Array Int Int)) (v_ArrVal_4946 (Array Int Int)) (v_ArrVal_4947 (Array Int Int)) (v_ArrVal_4948 (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_4946))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4947)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4948)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4949)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_4950))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4951)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-08 17:17:00,457 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4949 (Array Int Int)) (v_ArrVal_4950 (Array Int Int)) (v_ArrVal_4951 (Array Int Int)) (v_ArrVal_4954 (Array Int Int)) (v_ArrVal_4946 (Array Int Int)) (v_ArrVal_4947 (Array Int Int)) (v_ArrVal_4948 (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~mem50#1.base| v_ArrVal_4954))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4946)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4947)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4948)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4949)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4950))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4951)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 17:17:00,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211830408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:17:00,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:17:00,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 17] total 22 [2024-11-08 17:17:00,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857618928] [2024-11-08 17:17:00,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:17:00,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 17:17:00,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:00,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 17:17:00,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=659, Unknown=41, NotChecked=610, Total=1406 [2024-11-08 17:17:00,469 INFO L87 Difference]: Start difference. First operand 2696 states and 3769 transitions. Second operand has 22 states, 21 states have (on average 11.0) internal successors, (231), 21 states have internal predecessors, (231), 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)