./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/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_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/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_1f890db4-2d55-49fd-9224-9bf16aef740a/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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:15:41,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:15:41,775 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 17:15:41,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:15:41,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:15:41,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:15:41,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:15:41,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:15:41,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:15:41,838 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:15:41,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:15:41,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:15:41,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:15:41,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:15:41,841 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:15:41,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:15:41,842 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:15:41,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:15:41,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:15:41,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:15:41,844 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 17:15:41,848 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 17:15:41,848 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 17:15:41,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:15:41,849 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:15:41,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:15:41,850 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 17:15:41,850 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:15:41,850 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:15:41,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:15:41,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:15:41,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:15:41,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:15:41,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:15:41,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:15:41,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:15:41,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:15:41,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:15:41,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:15:41,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:15:41,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:15:41,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:15:41,856 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_1f890db4-2d55-49fd-9224-9bf16aef740a/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_1f890db4-2d55-49fd-9224-9bf16aef740a/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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-11-08 17:15:42,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:15:42,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:15:42,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:15:42,176 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:15:42,177 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:15:42,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i Unable to find full path for "g++" [2024-11-08 17:15:44,376 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:15:44,792 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:15:44,793 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i [2024-11-08 17:15:44,812 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/data/fc7258dab/855a0c9743d744c8ade1a75e831737b7/FLAGbd498efd4 [2024-11-08 17:15:44,831 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/data/fc7258dab/855a0c9743d744c8ade1a75e831737b7 [2024-11-08 17:15:44,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:15:44,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:15:44,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:15:44,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:15:44,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:15:44,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:15:44" (1/1) ... [2024-11-08 17:15:44,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4705a843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:44, skipping insertion in model container [2024-11-08 17:15:44,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:15:44" (1/1) ... [2024-11-08 17:15:44,913 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:15:45,513 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:15:45,587 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:15:45,597 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:15:45,610 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:15:45,625 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:15:45,652 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:15:45,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:15:45,688 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:15:45,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:15:45,912 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:15:45,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:45 WrapperNode [2024-11-08 17:15:45,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:15:45,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:15:45,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:15:45,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:15:45,926 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:15:45" (1/1) ... [2024-11-08 17:15:45,964 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:15:45" (1/1) ... [2024-11-08 17:15:46,034 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 787 [2024-11-08 17:15:46,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:15:46,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:15:46,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:15:46,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:15:46,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:45" (1/1) ... [2024-11-08 17:15:46,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:45" (1/1) ... [2024-11-08 17:15:46,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:45" (1/1) ... [2024-11-08 17:15:46,141 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-08 17:15:46,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:45" (1/1) ... [2024-11-08 17:15:46,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:45" (1/1) ... [2024-11-08 17:15:46,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:45" (1/1) ... [2024-11-08 17:15:46,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:45" (1/1) ... [2024-11-08 17:15:46,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:45" (1/1) ... [2024-11-08 17:15:46,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:45" (1/1) ... [2024-11-08 17:15:46,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:15:46,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:15:46,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:15:46,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:15:46,263 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:45" (1/1) ... [2024-11-08 17:15:46,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:15:46,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:15:46,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/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:15:46,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/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:15:46,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:15:46,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:15:46,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:15:46,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:15:46,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-08 17:15:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-08 17:15:46,414 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-08 17:15:46,414 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-08 17:15:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 17:15:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:15:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 17:15:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 17:15:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 17:15:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 17:15:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 17:15:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:15:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:15:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:15:46,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:15:46,729 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:15:46,734 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:15:46,740 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 17:15:46,819 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 17:15:49,140 INFO L? ?]: Removed 767 outVars from TransFormulas that were not future-live. [2024-11-08 17:15:49,142 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:15:49,176 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:15:49,176 INFO L316 CfgBuilder]: Removed 27 assume(true) statements. [2024-11-08 17:15:49,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:15:49 BoogieIcfgContainer [2024-11-08 17:15:49,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:15:49,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:15:49,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:15:49,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:15:49,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:15:44" (1/3) ... [2024-11-08 17:15:49,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@957eb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:15:49, skipping insertion in model container [2024-11-08 17:15:49,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:45" (2/3) ... [2024-11-08 17:15:49,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@957eb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:15:49, skipping insertion in model container [2024-11-08 17:15:49,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:15:49" (3/3) ... [2024-11-08 17:15:49,188 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test1-1.i [2024-11-08 17:15:49,210 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:15:49,211 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-08 17:15:49,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:15:49,306 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;@638a1bf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:15:49,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-08 17:15:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 741 states, 419 states have (on average 2.052505966587112) internal successors, (860), 736 states have internal predecessors, (860), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:15:49,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 17:15:49,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:49,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 17:15:49,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:15:49,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:49,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042701, now seen corresponding path program 1 times [2024-11-08 17:15:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:49,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985706978] [2024-11-08 17:15:49,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:49,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:49,507 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:15:49,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:49,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985706978] [2024-11-08 17:15:49,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985706978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:49,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:49,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:15:49,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123647678] [2024-11-08 17:15:49,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:49,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:15:49,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:49,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:15:49,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:15:49,591 INFO L87 Difference]: Start difference. First operand has 741 states, 419 states have (on average 2.052505966587112) internal successors, (860), 736 states have internal predecessors, (860), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:49,676 INFO L93 Difference]: Finished difference Result 731 states and 823 transitions. [2024-11-08 17:15:49,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:15:49,679 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 17:15:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:49,698 INFO L225 Difference]: With dead ends: 731 [2024-11-08 17:15:49,699 INFO L226 Difference]: Without dead ends: 729 [2024-11-08 17:15:49,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:15:49,706 INFO L432 NwaCegarLoop]: 823 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:49,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:15:49,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-11-08 17:15:49,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2024-11-08 17:15:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 413 states have (on average 1.973365617433414) internal successors, (815), 724 states have internal predecessors, (815), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:15:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 821 transitions. [2024-11-08 17:15:49,818 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 821 transitions. Word has length 6 [2024-11-08 17:15:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:49,819 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 821 transitions. [2024-11-08 17:15:49,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 821 transitions. [2024-11-08 17:15:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 17:15:49,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:49,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 17:15:49,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:15:49,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:15:49,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:49,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042763, now seen corresponding path program 1 times [2024-11-08 17:15:49,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:49,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587264674] [2024-11-08 17:15:49,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:49,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:49,961 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:15:49,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:49,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587264674] [2024-11-08 17:15:49,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587264674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:49,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:49,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:15:49,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963961653] [2024-11-08 17:15:49,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:49,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:15:49,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:49,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:15:49,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:15:49,969 INFO L87 Difference]: Start difference. First operand 729 states and 821 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:50,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:50,858 INFO L93 Difference]: Finished difference Result 683 states and 777 transitions. [2024-11-08 17:15:50,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:15:50,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 17:15:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:50,863 INFO L225 Difference]: With dead ends: 683 [2024-11-08 17:15:50,864 INFO L226 Difference]: Without dead ends: 683 [2024-11-08 17:15:50,864 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:15:50,866 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 684 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:50,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 478 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 17:15:50,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-11-08 17:15:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 680. [2024-11-08 17:15:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 413 states have (on average 1.854721549636804) internal successors, (766), 675 states have internal predecessors, (766), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:15:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 772 transitions. [2024-11-08 17:15:50,897 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 772 transitions. Word has length 6 [2024-11-08 17:15:50,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:50,898 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 772 transitions. [2024-11-08 17:15:50,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 772 transitions. [2024-11-08 17:15:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 17:15:50,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:50,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 17:15:50,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:15:50,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:15:50,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:50,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042764, now seen corresponding path program 1 times [2024-11-08 17:15:50,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:50,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51623246] [2024-11-08 17:15:50,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:51,036 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:15:51,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:51,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51623246] [2024-11-08 17:15:51,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51623246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:51,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:51,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:15:51,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222101094] [2024-11-08 17:15:51,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:51,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:15:51,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:51,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:15:51,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:15:51,041 INFO L87 Difference]: Start difference. First operand 680 states and 772 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:51,820 INFO L93 Difference]: Finished difference Result 758 states and 857 transitions. [2024-11-08 17:15:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:15:51,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 17:15:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:51,824 INFO L225 Difference]: With dead ends: 758 [2024-11-08 17:15:51,825 INFO L226 Difference]: Without dead ends: 758 [2024-11-08 17:15:51,825 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:15:51,827 INFO L432 NwaCegarLoop]: 644 mSDtfsCounter, 420 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:51,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 842 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:15:51,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-11-08 17:15:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 709. [2024-11-08 17:15:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 453 states have (on average 1.8410596026490067) internal successors, (834), 704 states have internal predecessors, (834), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:15:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 840 transitions. [2024-11-08 17:15:51,851 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 840 transitions. Word has length 6 [2024-11-08 17:15:51,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:51,851 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 840 transitions. [2024-11-08 17:15:51,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 840 transitions. [2024-11-08 17:15:51,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 17:15:51,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:51,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:51,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:15:51,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:15:51,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:51,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1975206730, now seen corresponding path program 1 times [2024-11-08 17:15:51,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:51,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376814872] [2024-11-08 17:15:51,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:51,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:51,898 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:15:51,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:51,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376814872] [2024-11-08 17:15:51,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376814872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:51,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:51,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:15:51,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263953039] [2024-11-08 17:15:51,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:51,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:15:51,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:51,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:15:51,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:15:51,902 INFO L87 Difference]: Start difference. First operand 709 states and 840 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) 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:15:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:51,953 INFO L93 Difference]: Finished difference Result 1393 states and 1652 transitions. [2024-11-08 17:15:51,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:15:51,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) 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:15:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:51,960 INFO L225 Difference]: With dead ends: 1393 [2024-11-08 17:15:51,960 INFO L226 Difference]: Without dead ends: 1393 [2024-11-08 17:15:51,960 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:15:51,962 INFO L432 NwaCegarLoop]: 757 mSDtfsCounter, 726 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:51,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1511 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:15:51,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-11-08 17:15:51,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 711. [2024-11-08 17:15:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 455 states have (on average 1.8373626373626373) internal successors, (836), 706 states have internal predecessors, (836), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:15:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 842 transitions. [2024-11-08 17:15:51,989 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 842 transitions. Word has length 7 [2024-11-08 17:15:51,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:51,990 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 842 transitions. [2024-11-08 17:15:51,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) 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:15:51,990 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 842 transitions. [2024-11-08 17:15:51,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 17:15:51,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:51,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:51,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:15:51,992 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:15:51,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:51,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2115082515, now seen corresponding path program 1 times [2024-11-08 17:15:51,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:51,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710135486] [2024-11-08 17:15:51,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:51,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:52,135 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:15:52,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:52,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710135486] [2024-11-08 17:15:52,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710135486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:52,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:52,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:15:52,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559659242] [2024-11-08 17:15:52,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:52,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:15:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:52,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:15:52,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:15:52,138 INFO L87 Difference]: Start difference. First operand 711 states and 842 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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:15:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:52,905 INFO L93 Difference]: Finished difference Result 737 states and 895 transitions. [2024-11-08 17:15:52,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:15:52,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-11-08 17:15:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:52,908 INFO L225 Difference]: With dead ends: 737 [2024-11-08 17:15:52,909 INFO L226 Difference]: Without dead ends: 737 [2024-11-08 17:15:52,909 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:15:52,910 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 949 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:52,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 747 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:15:52,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-11-08 17:15:52,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 688. [2024-11-08 17:15:52,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 455 states have (on average 1.786813186813187) internal successors, (813), 683 states have internal predecessors, (813), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:15:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 819 transitions. [2024-11-08 17:15:52,930 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 819 transitions. Word has length 17 [2024-11-08 17:15:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:52,931 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 819 transitions. [2024-11-08 17:15:52,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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:15:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 819 transitions. [2024-11-08 17:15:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 17:15:52,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:52,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:52,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:15:52,933 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:15:52,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:52,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2115082514, now seen corresponding path program 1 times [2024-11-08 17:15:52,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:52,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922826664] [2024-11-08 17:15:52,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:52,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:53,055 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:15:53,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:53,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922826664] [2024-11-08 17:15:53,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922826664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:53,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:53,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:15:53,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447293778] [2024-11-08 17:15:53,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:53,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:15:53,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:53,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:15:53,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:15:53,059 INFO L87 Difference]: Start difference. First operand 688 states and 819 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:15:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:53,107 INFO L93 Difference]: Finished difference Result 612 states and 714 transitions. [2024-11-08 17:15:53,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:15:53,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2024-11-08 17:15:53,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:53,113 INFO L225 Difference]: With dead ends: 612 [2024-11-08 17:15:53,114 INFO L226 Difference]: Without dead ends: 612 [2024-11-08 17:15:53,114 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:15:53,117 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 61 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1189 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:15:53,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1189 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:15:53,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-08 17:15:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2024-11-08 17:15:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 391 states have (on average 1.8107416879795397) internal successors, (708), 607 states have internal predecessors, (708), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:15:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 714 transitions. [2024-11-08 17:15:53,139 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 714 transitions. Word has length 17 [2024-11-08 17:15:53,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:53,140 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 714 transitions. [2024-11-08 17:15:53,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:15:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 714 transitions. [2024-11-08 17:15:53,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 17:15:53,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:53,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:53,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:15:53,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:15:53,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:53,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1136278920, now seen corresponding path program 1 times [2024-11-08 17:15:53,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:53,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942319354] [2024-11-08 17:15:53,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:53,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:53,243 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:15:53,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:53,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942319354] [2024-11-08 17:15:53,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942319354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:53,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:53,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:15:53,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305611263] [2024-11-08 17:15:53,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:53,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:15:53,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:53,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:15:53,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:15:53,247 INFO L87 Difference]: Start difference. First operand 612 states and 714 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:53,330 INFO L93 Difference]: Finished difference Result 594 states and 689 transitions. [2024-11-08 17:15:53,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:15:53,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-08 17:15:53,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:53,333 INFO L225 Difference]: With dead ends: 594 [2024-11-08 17:15:53,334 INFO L226 Difference]: Without dead ends: 594 [2024-11-08 17:15:53,334 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:15:53,335 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 41 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:53,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1730 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:15:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-11-08 17:15:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 591. [2024-11-08 17:15:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 586 states have internal predecessors, (680), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:15:53,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 686 transitions. [2024-11-08 17:15:53,352 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 686 transitions. Word has length 18 [2024-11-08 17:15:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:53,353 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 686 transitions. [2024-11-08 17:15:53,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:53,354 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 686 transitions. [2024-11-08 17:15:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 17:15:53,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:53,355 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] [2024-11-08 17:15:53,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:15:53,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:15:53,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:53,356 INFO L85 PathProgramCache]: Analyzing trace with hash 899773094, now seen corresponding path program 1 times [2024-11-08 17:15:53,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:53,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169829079] [2024-11-08 17:15:53,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:53,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:53,608 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:15:53,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:53,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169829079] [2024-11-08 17:15:53,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169829079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:53,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:53,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:15:53,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567421830] [2024-11-08 17:15:53,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:53,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:15:53,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:53,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:15:53,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:15:53,613 INFO L87 Difference]: Start difference. First operand 591 states and 686 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:54,417 INFO L93 Difference]: Finished difference Result 685 states and 775 transitions. [2024-11-08 17:15:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:15:54,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-08 17:15:54,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:54,425 INFO L225 Difference]: With dead ends: 685 [2024-11-08 17:15:54,426 INFO L226 Difference]: Without dead ends: 685 [2024-11-08 17:15:54,426 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:15:54,427 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 419 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:54,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1029 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:15:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-11-08 17:15:54,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 587. [2024-11-08 17:15:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 377 states have (on average 1.793103448275862) internal successors, (676), 582 states have internal predecessors, (676), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:15:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 682 transitions. [2024-11-08 17:15:54,444 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 682 transitions. Word has length 32 [2024-11-08 17:15:54,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:54,446 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 682 transitions. [2024-11-08 17:15:54,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 682 transitions. [2024-11-08 17:15:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 17:15:54,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:54,452 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] [2024-11-08 17:15:54,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:15:54,452 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:15:54,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:54,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1786048504, now seen corresponding path program 1 times [2024-11-08 17:15:54,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:54,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742134205] [2024-11-08 17:15:54,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:54,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:54,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:15:54,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:54,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742134205] [2024-11-08 17:15:54,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742134205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:54,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:54,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:15:54,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318524814] [2024-11-08 17:15:54,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:54,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:15:54,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:54,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:15:54,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:15:54,649 INFO L87 Difference]: Start difference. First operand 587 states and 682 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:54,724 INFO L93 Difference]: Finished difference Result 587 states and 678 transitions. [2024-11-08 17:15:54,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:15:54,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-08 17:15:54,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:54,727 INFO L225 Difference]: With dead ends: 587 [2024-11-08 17:15:54,728 INFO L226 Difference]: Without dead ends: 587 [2024-11-08 17:15:54,728 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:15:54,729 INFO L432 NwaCegarLoop]: 581 mSDtfsCounter, 21 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:54,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1712 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:15:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-11-08 17:15:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2024-11-08 17:15:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 377 states have (on average 1.7824933687002653) internal successors, (672), 582 states have internal predecessors, (672), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:15:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 678 transitions. [2024-11-08 17:15:54,745 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 678 transitions. Word has length 66 [2024-11-08 17:15:54,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:54,747 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 678 transitions. [2024-11-08 17:15:54,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:54,748 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 678 transitions. [2024-11-08 17:15:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 17:15:54,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:54,750 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:15:54,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:15:54,750 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:15:54,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:54,751 INFO L85 PathProgramCache]: Analyzing trace with hash 562725700, now seen corresponding path program 1 times [2024-11-08 17:15:54,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:54,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278363984] [2024-11-08 17:15:54,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:54,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:54,949 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:15:54,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:54,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278363984] [2024-11-08 17:15:54,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278363984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:54,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:54,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:15:54,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302516309] [2024-11-08 17:15:54,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:54,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:15:54,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:54,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:15:54,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:15:54,955 INFO L87 Difference]: Start difference. First operand 587 states and 678 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:55,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:55,013 INFO L93 Difference]: Finished difference Result 683 states and 801 transitions. [2024-11-08 17:15:55,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:15:55,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-08 17:15:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:55,016 INFO L225 Difference]: With dead ends: 683 [2024-11-08 17:15:55,017 INFO L226 Difference]: Without dead ends: 683 [2024-11-08 17:15:55,018 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:15:55,018 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 54 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:55,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1164 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:15:55,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-11-08 17:15:55,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2024-11-08 17:15:55,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 473 states have (on average 1.6807610993657505) internal successors, (795), 678 states have internal predecessors, (795), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:15:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 801 transitions. [2024-11-08 17:15:55,036 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 801 transitions. Word has length 74 [2024-11-08 17:15:55,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:55,038 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 801 transitions. [2024-11-08 17:15:55,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:55,039 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 801 transitions. [2024-11-08 17:15:55,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 17:15:55,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:55,043 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] [2024-11-08 17:15:55,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:15:55,043 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:15:55,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:55,043 INFO L85 PathProgramCache]: Analyzing trace with hash 796825283, now seen corresponding path program 1 times [2024-11-08 17:15:55,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:55,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776744159] [2024-11-08 17:15:55,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:55,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:55,697 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:15:55,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:55,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776744159] [2024-11-08 17:15:55,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776744159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:55,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:55,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:15:55,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671450694] [2024-11-08 17:15:55,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:55,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:15:55,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:55,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:15:55,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:15:55,701 INFO L87 Difference]: Start difference. First operand 683 states and 801 transitions. Second operand has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:56,559 INFO L93 Difference]: Finished difference Result 645 states and 763 transitions. [2024-11-08 17:15:56,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:15:56,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-08 17:15:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:56,562 INFO L225 Difference]: With dead ends: 645 [2024-11-08 17:15:56,563 INFO L226 Difference]: Without dead ends: 645 [2024-11-08 17:15:56,563 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:15:56,564 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 926 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:56,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 481 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 17:15:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-11-08 17:15:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 605. [2024-11-08 17:15:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 433 states have (on average 1.5658198614318706) internal successors, (678), 600 states have internal predecessors, (678), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:15:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 684 transitions. [2024-11-08 17:15:56,578 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 684 transitions. Word has length 77 [2024-11-08 17:15:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:56,579 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 684 transitions. [2024-11-08 17:15:56,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 684 transitions. [2024-11-08 17:15:56,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 17:15:56,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:56,581 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] [2024-11-08 17:15:56,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:15:56,581 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:15:56,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:56,582 INFO L85 PathProgramCache]: Analyzing trace with hash 853132439, now seen corresponding path program 1 times [2024-11-08 17:15:56,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:56,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732937283] [2024-11-08 17:15:56,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:56,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:56,967 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:15:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:56,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732937283] [2024-11-08 17:15:56,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732937283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:56,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:56,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:15:56,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811895732] [2024-11-08 17:15:56,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:56,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:15:56,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:56,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:15:56,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:15:56,973 INFO L87 Difference]: Start difference. First operand 605 states and 684 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:57,714 INFO L93 Difference]: Finished difference Result 604 states and 683 transitions. [2024-11-08 17:15:57,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:15:57,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-08 17:15:57,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:57,718 INFO L225 Difference]: With dead ends: 604 [2024-11-08 17:15:57,718 INFO L226 Difference]: Without dead ends: 604 [2024-11-08 17:15:57,718 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:15:57,719 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 2 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:57,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1528 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:15:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-08 17:15:57,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-11-08 17:15:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 433 states have (on average 1.5635103926096998) internal successors, (677), 599 states have internal predecessors, (677), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:15:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 683 transitions. [2024-11-08 17:15:57,733 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 683 transitions. Word has length 82 [2024-11-08 17:15:57,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:57,733 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 683 transitions. [2024-11-08 17:15:57,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:57,734 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 683 transitions. [2024-11-08 17:15:57,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 17:15:57,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:57,735 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] [2024-11-08 17:15:57,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:15:57,735 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:15:57,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:57,736 INFO L85 PathProgramCache]: Analyzing trace with hash 853132440, now seen corresponding path program 1 times [2024-11-08 17:15:57,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:57,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026426050] [2024-11-08 17:15:57,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:57,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:58,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:58,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026426050] [2024-11-08 17:15:58,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026426050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:58,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:58,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:15:58,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474914913] [2024-11-08 17:15:58,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:58,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:15:58,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:58,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:15:58,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:15:58,360 INFO L87 Difference]: Start difference. First operand 604 states and 683 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:59,158 INFO L93 Difference]: Finished difference Result 603 states and 682 transitions. [2024-11-08 17:15:59,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:15:59,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-08 17:15:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:59,161 INFO L225 Difference]: With dead ends: 603 [2024-11-08 17:15:59,162 INFO L226 Difference]: Without dead ends: 603 [2024-11-08 17:15:59,162 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:15:59,163 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 1 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:59,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1537 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:15:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-08 17:15:59,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2024-11-08 17:15:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 432 states have (on average 1.5648148148148149) internal successors, (676), 598 states have internal predecessors, (676), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:15:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 682 transitions. [2024-11-08 17:15:59,177 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 682 transitions. Word has length 82 [2024-11-08 17:15:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:59,178 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 682 transitions. [2024-11-08 17:15:59,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:15:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 682 transitions. [2024-11-08 17:15:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 17:15:59,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:59,179 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:15:59,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:15:59,179 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:15:59,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2144581854, now seen corresponding path program 1 times [2024-11-08 17:15:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:59,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677706257] [2024-11-08 17:15:59,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:59,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:15:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:59,634 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:15:59,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:59,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677706257] [2024-11-08 17:15:59,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677706257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:59,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:59,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:15:59,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708997982] [2024-11-08 17:15:59,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:59,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:59,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:59,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:59,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:59,638 INFO L87 Difference]: Start difference. First operand 603 states and 682 transitions. Second operand has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:16:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:00,592 INFO L93 Difference]: Finished difference Result 615 states and 697 transitions. [2024-11-08 17:16:00,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:16:00,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-08 17:16:00,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:00,597 INFO L225 Difference]: With dead ends: 615 [2024-11-08 17:16:00,597 INFO L226 Difference]: Without dead ends: 615 [2024-11-08 17:16:00,597 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:16:00,598 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 10 mSDsluCounter, 1808 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:00,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2354 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 17:16:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-08 17:16:00,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 609. [2024-11-08 17:16:00,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 437 states have (on average 1.562929061784897) internal successors, (683), 603 states have internal predecessors, (683), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 17:16:00,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 692 transitions. [2024-11-08 17:16:00,611 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 692 transitions. Word has length 90 [2024-11-08 17:16:00,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:00,611 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 692 transitions. [2024-11-08 17:16:00,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:16:00,612 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 692 transitions. [2024-11-08 17:16:00,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 17:16:00,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:00,613 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:16:00,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:16:00,613 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:16:00,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:00,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2144581855, now seen corresponding path program 1 times [2024-11-08 17:16:00,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:00,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257280739] [2024-11-08 17:16:00,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:00,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:01,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:01,334 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:16:01,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:01,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257280739] [2024-11-08 17:16:01,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257280739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:01,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:01,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:16:01,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160712636] [2024-11-08 17:16:01,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:01,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:16:01,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:01,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:16:01,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:16:01,337 INFO L87 Difference]: Start difference. First operand 609 states and 692 transitions. Second operand has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:16:02,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:02,317 INFO L93 Difference]: Finished difference Result 609 states and 691 transitions. [2024-11-08 17:16:02,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:16:02,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-08 17:16:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:02,319 INFO L225 Difference]: With dead ends: 609 [2024-11-08 17:16:02,320 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 17:16:02,320 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:16:02,322 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 5 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:02,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2393 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 17:16:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 17:16:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-08 17:16:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 437 states have (on average 1.5606407322654463) internal successors, (682), 603 states have internal predecessors, (682), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 17:16:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 691 transitions. [2024-11-08 17:16:02,339 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 691 transitions. Word has length 90 [2024-11-08 17:16:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:02,340 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 691 transitions. [2024-11-08 17:16:02,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:16:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 691 transitions. [2024-11-08 17:16:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 17:16:02,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:02,341 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:16:02,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:16:02,342 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:16:02,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:02,342 INFO L85 PathProgramCache]: Analyzing trace with hash -930241591, now seen corresponding path program 1 times [2024-11-08 17:16:02,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:02,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931963928] [2024-11-08 17:16:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:02,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:02,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:16:03,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:03,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931963928] [2024-11-08 17:16:03,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931963928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:03,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668649299] [2024-11-08 17:16:03,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:03,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:03,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:16:03,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:16:03,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:16:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:03,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 17:16:03,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:16:03,565 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:16:03,567 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:03,593 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:03,722 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:03,722 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:03,778 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:03,784 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:16:03,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:16:03,860 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-08 17:16:03,861 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:16:03,880 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_508) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem51#1.base|)) is different from false [2024-11-08 17:16:03,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668649299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:03,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:16:03,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2024-11-08 17:16:03,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779342431] [2024-11-08 17:16:03,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:16:03,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 17:16:03,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:03,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 17:16:03,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2024-11-08 17:16:03,885 INFO L87 Difference]: Start difference. First operand 609 states and 691 transitions. Second operand has 15 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 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:16:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:06,283 INFO L93 Difference]: Finished difference Result 608 states and 690 transitions. [2024-11-08 17:16:06,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:16:06,284 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 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 91 [2024-11-08 17:16:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:06,287 INFO L225 Difference]: With dead ends: 608 [2024-11-08 17:16:06,287 INFO L226 Difference]: Without dead ends: 608 [2024-11-08 17:16:06,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 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:16:06,288 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 507 mSDsluCounter, 2526 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:06,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 2858 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 17:16:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-08 17:16:06,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-11-08 17:16:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 437 states have (on average 1.5583524027459954) internal successors, (681), 602 states have internal predecessors, (681), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 17:16:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 690 transitions. [2024-11-08 17:16:06,305 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 690 transitions. Word has length 91 [2024-11-08 17:16:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:06,305 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 690 transitions. [2024-11-08 17:16:06,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 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:16:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 690 transitions. [2024-11-08 17:16:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 17:16:06,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:06,307 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:16:06,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:16:06,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 17:16:06,508 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:16:06,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:06,509 INFO L85 PathProgramCache]: Analyzing trace with hash -930241590, now seen corresponding path program 1 times [2024-11-08 17:16:06,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:06,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114347970] [2024-11-08 17:16:06,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:06,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:07,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:07,772 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:16:07,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:07,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114347970] [2024-11-08 17:16:07,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114347970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:07,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759930044] [2024-11-08 17:16:07,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:07,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:07,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:16:07,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:16:07,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:16:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:08,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 17:16:08,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:16:08,181 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:16:08,181 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:08,191 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:16:08,207 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:08,246 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:08,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 22 treesize of output 10 [2024-11-08 17:16:08,347 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:08,542 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:08,542 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:08,554 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:08,596 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:08,603 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:08,608 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:16:08,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:16:08,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759930044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:08,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:16:08,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2024-11-08 17:16:08,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161825893] [2024-11-08 17:16:08,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:16:08,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:16:08,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:08,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:16:08,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=278, Unknown=8, NotChecked=0, Total=342 [2024-11-08 17:16:08,807 INFO L87 Difference]: Start difference. First operand 608 states and 690 transitions. Second operand has 16 states, 13 states have (on average 8.461538461538462) internal successors, (110), 15 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 17:16:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:10,862 INFO L93 Difference]: Finished difference Result 615 states and 697 transitions. [2024-11-08 17:16:10,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:16:10,862 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 8.461538461538462) internal successors, (110), 15 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2024-11-08 17:16:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:10,865 INFO L225 Difference]: With dead ends: 615 [2024-11-08 17:16:10,866 INFO L226 Difference]: Without dead ends: 615 [2024-11-08 17:16:10,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=451, Unknown=9, NotChecked=0, Total=552 [2024-11-08 17:16:10,867 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 483 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 2307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:10,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 2158 Invalid, 2307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 17:16:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-08 17:16:10,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 606. [2024-11-08 17:16:10,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 436 states have (on average 1.5573394495412844) internal successors, (679), 600 states have internal predecessors, (679), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:16:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 685 transitions. [2024-11-08 17:16:10,880 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 685 transitions. Word has length 91 [2024-11-08 17:16:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:10,880 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 685 transitions. [2024-11-08 17:16:10,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 8.461538461538462) internal successors, (110), 15 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 17:16:10,881 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 685 transitions. [2024-11-08 17:16:10,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 17:16:10,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:10,882 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:16:10,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 17:16:11,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 17:16:11,082 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:16:11,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:11,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1600093258, now seen corresponding path program 1 times [2024-11-08 17:16:11,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:11,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428405516] [2024-11-08 17:16:11,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:11,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:11,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:11,802 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:16:11,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:11,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428405516] [2024-11-08 17:16:11,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428405516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:11,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:11,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 17:16:11,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540085380] [2024-11-08 17:16:11,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:11,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:16:11,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:11,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:16:11,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:16:11,808 INFO L87 Difference]: Start difference. First operand 606 states and 685 transitions. Second operand has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:16:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:13,508 INFO L93 Difference]: Finished difference Result 619 states and 701 transitions. [2024-11-08 17:16:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:16:13,508 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-08 17:16:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:13,510 INFO L225 Difference]: With dead ends: 619 [2024-11-08 17:16:13,510 INFO L226 Difference]: Without dead ends: 619 [2024-11-08 17:16:13,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:16:13,511 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 493 mSDsluCounter, 2524 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 2855 SdHoareTripleChecker+Invalid, 2164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:13,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 2855 Invalid, 2164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2150 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 17:16:13,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-08 17:16:13,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2024-11-08 17:16:13,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 444 states have (on average 1.5518018018018018) internal successors, (689), 608 states have internal predecessors, (689), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:16:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 696 transitions. [2024-11-08 17:16:13,525 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 696 transitions. Word has length 93 [2024-11-08 17:16:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:13,526 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 696 transitions. [2024-11-08 17:16:13,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:16:13,526 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 696 transitions. [2024-11-08 17:16:13,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 17:16:13,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:13,527 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:16:13,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 17:16:13,528 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:16:13,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:13,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1600093259, now seen corresponding path program 1 times [2024-11-08 17:16:13,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:13,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57403839] [2024-11-08 17:16:13,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:13,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:14,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:14,436 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:16:14,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:14,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57403839] [2024-11-08 17:16:14,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57403839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:14,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:14,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 17:16:14,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665469126] [2024-11-08 17:16:14,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:14,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:16:14,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:14,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:16:14,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:16:14,439 INFO L87 Difference]: Start difference. First operand 615 states and 696 transitions. Second operand has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:16:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:16,347 INFO L93 Difference]: Finished difference Result 618 states and 700 transitions. [2024-11-08 17:16:16,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:16:16,348 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-08 17:16:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:16,350 INFO L225 Difference]: With dead ends: 618 [2024-11-08 17:16:16,350 INFO L226 Difference]: Without dead ends: 618 [2024-11-08 17:16:16,351 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:16:16,351 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 485 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:16,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 2158 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 17:16:16,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-08 17:16:16,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2024-11-08 17:16:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 444 states have (on average 1.5495495495495495) internal successors, (688), 608 states have internal predecessors, (688), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:16:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 695 transitions. [2024-11-08 17:16:16,364 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 695 transitions. Word has length 93 [2024-11-08 17:16:16,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:16,364 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 695 transitions. [2024-11-08 17:16:16,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:16:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 695 transitions. [2024-11-08 17:16:16,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:16:16,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:16,366 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:16:16,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 17:16:16,366 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:16:16,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:16,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1697634945, now seen corresponding path program 1 times [2024-11-08 17:16:16,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:16,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916824459] [2024-11-08 17:16:16,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:16,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:16,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:17,072 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:16:17,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:17,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916824459] [2024-11-08 17:16:17,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916824459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:17,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777139769] [2024-11-08 17:16:17,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:17,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:17,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:16:17,075 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:16:17,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:16:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:17,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 17:16:17,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:16:17,484 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:16:17,484 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:17,494 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:17,595 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:17,595 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:17,661 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:17,661 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:17,679 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:17,684 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:16:17,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:16:17,698 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_896) |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:16:17,783 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-08 17:16:17,784 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:17,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777139769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:17,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:16:17,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 16 [2024-11-08 17:16:17,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936918838] [2024-11-08 17:16:17,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:16:17,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 17:16:17,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:17,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 17:16:17,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=277, Unknown=16, NotChecked=34, Total=380 [2024-11-08 17:16:17,837 INFO L87 Difference]: Start difference. First operand 615 states and 695 transitions. Second operand has 17 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 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:16:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:19,431 INFO L93 Difference]: Finished difference Result 617 states and 699 transitions. [2024-11-08 17:16:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:16:19,432 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 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 94 [2024-11-08 17:16:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:19,434 INFO L225 Difference]: With dead ends: 617 [2024-11-08 17:16:19,434 INFO L226 Difference]: Without dead ends: 617 [2024-11-08 17:16:19,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=574, Unknown=17, NotChecked=50, Total=756 [2024-11-08 17:16:19,436 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 501 mSDsluCounter, 2530 mSDsCounter, 0 mSdLazyCounter, 2132 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2861 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:19,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 2861 Invalid, 2146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2132 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 17:16:19,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-08 17:16:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2024-11-08 17:16:19,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 444 states have (on average 1.5472972972972974) internal successors, (687), 607 states have internal predecessors, (687), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:16:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 694 transitions. [2024-11-08 17:16:19,448 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 694 transitions. Word has length 94 [2024-11-08 17:16:19,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:19,449 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 694 transitions. [2024-11-08 17:16:19,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 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:16:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 694 transitions. [2024-11-08 17:16:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:16:19,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:19,451 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:16:19,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 17:16:19,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:19,652 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:16:19,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:19,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1697634944, now seen corresponding path program 1 times [2024-11-08 17:16:19,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:19,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112712719] [2024-11-08 17:16:19,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:19,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:20,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:20,895 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:16:20,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:20,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112712719] [2024-11-08 17:16:20,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112712719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:20,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580450423] [2024-11-08 17:16:20,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:20,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:20,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:16:20,899 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:16:20,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 17:16:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:21,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 17:16:21,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:16:21,255 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:16:21,256 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:21,281 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:21,285 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:21,498 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:21,499 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:21,504 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:21,608 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:21,608 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:21,617 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:21,639 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:21,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 17:16:21,668 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:16:21,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:16:21,840 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_1040 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1040) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1040) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-08 17:16:21,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:16:21,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 88 [2024-11-08 17:16:22,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580450423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:22,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:16:22,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2024-11-08 17:16:22,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482947752] [2024-11-08 17:16:22,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:16:22,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 17:16:22,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:22,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 17:16:22,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=548, Unknown=20, NotChecked=48, Total=702 [2024-11-08 17:16:22,100 INFO L87 Difference]: Start difference. First operand 614 states and 694 transitions. Second operand has 22 states, 19 states have (on average 6.421052631578948) internal successors, (122), 21 states have internal predecessors, (122), 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:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:25,224 INFO L93 Difference]: Finished difference Result 616 states and 698 transitions. [2024-11-08 17:16:25,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:16:25,225 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.421052631578948) internal successors, (122), 21 states have internal predecessors, (122), 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:16:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:25,227 INFO L225 Difference]: With dead ends: 616 [2024-11-08 17:16:25,227 INFO L226 Difference]: Without dead ends: 616 [2024-11-08 17:16:25,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=830, Unknown=24, NotChecked=60, Total=1056 [2024-11-08 17:16:25,229 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 482 mSDsluCounter, 4066 mSDsCounter, 0 mSdLazyCounter, 4394 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 4395 SdHoareTripleChecker+Invalid, 4415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:25,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 4395 Invalid, 4415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4394 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 17:16:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-08 17:16:25,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 604. [2024-11-08 17:16:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 436 states have (on average 1.5527522935779816) internal successors, (677), 598 states have internal predecessors, (677), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:16:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 683 transitions. [2024-11-08 17:16:25,242 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 683 transitions. Word has length 94 [2024-11-08 17:16:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:25,243 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 683 transitions. [2024-11-08 17:16:25,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.421052631578948) internal successors, (122), 21 states have internal predecessors, (122), 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:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 683 transitions. [2024-11-08 17:16:25,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 17:16:25,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:25,244 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:16:25,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 17:16:25,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:25,449 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:16:25,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:25,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1463153530, now seen corresponding path program 1 times [2024-11-08 17:16:25,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:25,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733603163] [2024-11-08 17:16:25,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:25,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:26,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:26,619 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:16:26,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:26,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733603163] [2024-11-08 17:16:26,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733603163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:26,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:26,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 17:16:26,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591214142] [2024-11-08 17:16:26,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:26,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:16:26,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:26,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:16:26,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:16:26,624 INFO L87 Difference]: Start difference. First operand 604 states and 683 transitions. Second operand has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:16:28,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:28,494 INFO L93 Difference]: Finished difference Result 620 states and 702 transitions. [2024-11-08 17:16:28,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:16:28,495 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-08 17:16:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:28,498 INFO L225 Difference]: With dead ends: 620 [2024-11-08 17:16:28,498 INFO L226 Difference]: Without dead ends: 620 [2024-11-08 17:16:28,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:16:28,499 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 506 mSDsluCounter, 2150 mSDsCounter, 0 mSdLazyCounter, 2504 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 2516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:28,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 2484 Invalid, 2516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2504 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 17:16:28,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-08 17:16:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 616. [2024-11-08 17:16:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 447 states have (on average 1.5436241610738255) internal successors, (690), 609 states have internal predecessors, (690), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:16:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 697 transitions. [2024-11-08 17:16:28,512 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 697 transitions. Word has length 96 [2024-11-08 17:16:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:28,513 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 697 transitions. [2024-11-08 17:16:28,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:16:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 697 transitions. [2024-11-08 17:16:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 17:16:28,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:28,515 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:16:28,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 17:16:28,515 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:16:28,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1463153531, now seen corresponding path program 1 times [2024-11-08 17:16:28,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:28,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936787606] [2024-11-08 17:16:28,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:28,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:29,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:29,286 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:16:29,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:29,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936787606] [2024-11-08 17:16:29,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936787606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:29,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:29,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:16:29,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564410553] [2024-11-08 17:16:29,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:29,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 17:16:29,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:29,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 17:16:29,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:16:29,289 INFO L87 Difference]: Start difference. First operand 616 states and 697 transitions. Second operand has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:16:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:30,671 INFO L93 Difference]: Finished difference Result 619 states and 701 transitions. [2024-11-08 17:16:30,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:16:30,672 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-08 17:16:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:30,674 INFO L225 Difference]: With dead ends: 619 [2024-11-08 17:16:30,674 INFO L226 Difference]: Without dead ends: 619 [2024-11-08 17:16:30,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-08 17:16:30,675 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 490 mSDsluCounter, 2212 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 2543 SdHoareTripleChecker+Invalid, 1926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:30,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 2543 Invalid, 1926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:16:30,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-08 17:16:30,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 616. [2024-11-08 17:16:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 447 states have (on average 1.541387024608501) internal successors, (689), 609 states have internal predecessors, (689), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:16:30,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 696 transitions. [2024-11-08 17:16:30,687 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 696 transitions. Word has length 96 [2024-11-08 17:16:30,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:30,688 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 696 transitions. [2024-11-08 17:16:30,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:16:30,688 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 696 transitions. [2024-11-08 17:16:30,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 17:16:30,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:30,690 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:16:30,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 17:16:30,690 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:16:30,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:30,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1002120399, now seen corresponding path program 1 times [2024-11-08 17:16:30,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:30,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236046873] [2024-11-08 17:16:30,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:30,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:31,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:31,824 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:16:31,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:31,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236046873] [2024-11-08 17:16:31,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236046873] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:31,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951287795] [2024-11-08 17:16:31,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:31,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:31,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:16:31,827 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:16:31,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 17:16:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:32,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 17:16:32,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:16:32,217 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:16:32,217 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:32,241 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:32,353 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:32,353 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:32,415 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-08 17:16:32,416 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 69 treesize of output 41 [2024-11-08 17:16:32,423 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:32,604 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-08 17:16:32,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 66 [2024-11-08 17:16:32,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-08 17:16:32,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 17:16:32,693 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:16:32,698 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 34 treesize of output 16 [2024-11-08 17:16:32,730 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:16:32,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:16:32,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:16:32,962 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 112 treesize of output 116 [2024-11-08 17:16:33,073 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base|) (+ 16 |c_ULTIMATE.start_main_#t~mem53#1.offset|) |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1326 (Array Int Int)) (v_prenex_7 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1326))) (or (< (select (select (store .cse0 .cse1 v_prenex_7) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 9 |c_ULTIMATE.start_main_#t~mem53#1.offset|)) (< (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) 0)))) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1326 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1326))) (or (< (+ 4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) 0) (< 0 (+ 9 (select (select (store .cse3 .cse1 v_ArrVal_1328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (or (forall ((v_ArrVal_1327 (Array Int Int))) (= (select (select (store .cse4 .cse1 v_ArrVal_1327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~mem53#1.base|)) (and (forall ((v_ArrVal_1326 (Array Int Int))) (< (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) 0)) (forall ((v_ArrVal_1326 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1326))) (or (forall ((v_ArrVal_1328 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse5 .cse1 v_ArrVal_1328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (< (+ 4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) 0))))))))) is different from false [2024-11-08 17:16:33,135 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 992 treesize of output 938 [2024-11-08 17:16:33,156 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 688 treesize of output 680 [2024-11-08 17:16:33,166 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 680 treesize of output 672 [2024-11-08 17:16:33,174 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 672 treesize of output 668 [2024-11-08 17:16:33,186 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 668 treesize of output 660 [2024-11-08 17:16:33,198 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 660 treesize of output 652 [2024-11-08 17:16:33,213 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 652 treesize of output 644 [2024-11-08 17:16:33,223 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 644 treesize of output 636 [2024-11-08 17:16:33,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951287795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:33,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:16:33,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2024-11-08 17:16:33,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562048472] [2024-11-08 17:16:33,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:16:33,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 17:16:33,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:33,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 17:16:33,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=4, NotChecked=56, Total=930 [2024-11-08 17:16:33,393 INFO L87 Difference]: Start difference. First operand 616 states and 696 transitions. Second operand has 25 states, 22 states have (on average 5.818181818181818) internal successors, (128), 24 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 17:16:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:35,932 INFO L93 Difference]: Finished difference Result 618 states and 700 transitions. [2024-11-08 17:16:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:16:35,933 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.818181818181818) internal successors, (128), 24 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-08 17:16:35,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:35,935 INFO L225 Difference]: With dead ends: 618 [2024-11-08 17:16:35,936 INFO L226 Difference]: Without dead ends: 618 [2024-11-08 17:16:35,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=1143, Unknown=4, NotChecked=70, Total=1406 [2024-11-08 17:16:35,937 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 501 mSDsluCounter, 3358 mSDsCounter, 0 mSdLazyCounter, 3522 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 3691 SdHoareTripleChecker+Invalid, 3539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:35,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 3691 Invalid, 3539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3522 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 17:16:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-08 17:16:35,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2024-11-08 17:16:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 447 states have (on average 1.5391498881431767) internal successors, (688), 608 states have internal predecessors, (688), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:16:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 695 transitions. [2024-11-08 17:16:35,950 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 695 transitions. Word has length 97 [2024-11-08 17:16:35,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:35,950 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 695 transitions. [2024-11-08 17:16:35,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.818181818181818) internal successors, (128), 24 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 17:16:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 695 transitions. [2024-11-08 17:16:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 17:16:35,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:35,952 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:16:35,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 17:16:36,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:36,157 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:16:36,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:36,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1002120400, now seen corresponding path program 1 times [2024-11-08 17:16:36,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:36,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054905505] [2024-11-08 17:16:36,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:36,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:36,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:36,939 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:16:36,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:36,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054905505] [2024-11-08 17:16:36,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054905505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:36,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075833716] [2024-11-08 17:16:36,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:36,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:36,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:16:36,942 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:16:36,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 17:16:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:37,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 17:16:37,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:16:37,327 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:16:37,328 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:37,336 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:37,462 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:37,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 17:16:37,526 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:37,527 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:37,591 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:37,591 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:37,605 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:37,609 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:16:37,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:16:37,668 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1482 (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_1482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-08 17:16:37,679 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (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_1481))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1482)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 17:16:37,687 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (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_1481))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1482)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 17:16:37,741 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-08 17:16:37,742 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:16:37,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075833716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:37,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:16:37,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 19 [2024-11-08 17:16:37,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263299647] [2024-11-08 17:16:37,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:16:37,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 17:16:37,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:37,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 17:16:37,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=383, Unknown=19, NotChecked=126, Total=600 [2024-11-08 17:16:37,810 INFO L87 Difference]: Start difference. First operand 615 states and 695 transitions. Second operand has 20 states, 18 states have (on average 6.666666666666667) internal successors, (120), 19 states have internal predecessors, (120), 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:16:39,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:39,706 INFO L93 Difference]: Finished difference Result 617 states and 699 transitions. [2024-11-08 17:16:39,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:16:39,707 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.666666666666667) internal successors, (120), 19 states have internal predecessors, (120), 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 97 [2024-11-08 17:16:39,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:39,709 INFO L225 Difference]: With dead ends: 617 [2024-11-08 17:16:39,709 INFO L226 Difference]: Without dead ends: 617 [2024-11-08 17:16:39,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=779, Unknown=21, NotChecked=180, Total=1122 [2024-11-08 17:16:39,710 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 495 mSDsluCounter, 3776 mSDsCounter, 0 mSdLazyCounter, 3044 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 4106 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:39,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 4106 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3044 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 17:16:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-08 17:16:39,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 602. [2024-11-08 17:16:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 436 states have (on average 1.548165137614679) internal successors, (675), 596 states have internal predecessors, (675), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:16:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 681 transitions. [2024-11-08 17:16:39,722 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 681 transitions. Word has length 97 [2024-11-08 17:16:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:39,722 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 681 transitions. [2024-11-08 17:16:39,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.666666666666667) internal successors, (120), 19 states have internal predecessors, (120), 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:16:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 681 transitions. [2024-11-08 17:16:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 17:16:39,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:39,724 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] [2024-11-08 17:16:39,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 17:16:39,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-08 17:16:39,925 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:16:39,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:39,925 INFO L85 PathProgramCache]: Analyzing trace with hash 816867729, now seen corresponding path program 1 times [2024-11-08 17:16:39,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:39,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902213957] [2024-11-08 17:16:39,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:39,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:40,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:40,893 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:16:40,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:40,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902213957] [2024-11-08 17:16:40,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902213957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:40,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:40,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 17:16:40,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22198136] [2024-11-08 17:16:40,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:40,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:16:40,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:40,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:16:40,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:16:40,897 INFO L87 Difference]: Start difference. First operand 602 states and 681 transitions. Second operand has 16 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:16:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:42,259 INFO L93 Difference]: Finished difference Result 621 states and 703 transitions. [2024-11-08 17:16:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:16:42,260 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-08 17:16:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:42,261 INFO L225 Difference]: With dead ends: 621 [2024-11-08 17:16:42,262 INFO L226 Difference]: Without dead ends: 621 [2024-11-08 17:16:42,262 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:16:42,262 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 495 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:42,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 2538 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1930 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:16:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-08 17:16:42,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 617. [2024-11-08 17:16:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 450 states have (on average 1.5355555555555556) internal successors, (691), 610 states have internal predecessors, (691), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:16:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 698 transitions. [2024-11-08 17:16:42,273 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 698 transitions. Word has length 99 [2024-11-08 17:16:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:42,274 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 698 transitions. [2024-11-08 17:16:42,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:16:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 698 transitions. [2024-11-08 17:16:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 17:16:42,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:42,276 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] [2024-11-08 17:16:42,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 17:16:42,276 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:16:42,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:42,277 INFO L85 PathProgramCache]: Analyzing trace with hash 816867730, now seen corresponding path program 1 times [2024-11-08 17:16:42,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:42,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317162846] [2024-11-08 17:16:42,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:42,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:43,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:43,479 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:16:43,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:43,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317162846] [2024-11-08 17:16:43,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317162846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:43,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:43,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 17:16:43,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080848974] [2024-11-08 17:16:43,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:43,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:16:43,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:43,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:16:43,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:16:43,482 INFO L87 Difference]: Start difference. First operand 617 states and 698 transitions. Second operand has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:16:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:45,519 INFO L93 Difference]: Finished difference Result 620 states and 702 transitions. [2024-11-08 17:16:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:16:45,520 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-08 17:16:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:45,522 INFO L225 Difference]: With dead ends: 620 [2024-11-08 17:16:45,522 INFO L226 Difference]: Without dead ends: 620 [2024-11-08 17:16:45,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:16:45,523 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 488 mSDsluCounter, 2342 mSDsCounter, 0 mSdLazyCounter, 2814 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 2675 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:45,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 2675 Invalid, 2828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2814 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 17:16:45,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-08 17:16:45,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 617. [2024-11-08 17:16:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 450 states have (on average 1.5333333333333334) internal successors, (690), 610 states have internal predecessors, (690), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:16:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 697 transitions. [2024-11-08 17:16:45,537 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 697 transitions. Word has length 99 [2024-11-08 17:16:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:45,537 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 697 transitions. [2024-11-08 17:16:45,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:16:45,537 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 697 transitions. [2024-11-08 17:16:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 17:16:45,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:45,539 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:16:45,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 17:16:45,539 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:16:45,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:45,539 INFO L85 PathProgramCache]: Analyzing trace with hash 149460742, now seen corresponding path program 1 times [2024-11-08 17:16:45,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:45,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626087586] [2024-11-08 17:16:45,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:45,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:46,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:46,342 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:16:46,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:46,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626087586] [2024-11-08 17:16:46,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626087586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:46,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178361107] [2024-11-08 17:16:46,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:46,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:46,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:16:46,345 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:16:46,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 17:16:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:46,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 17:16:46,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:16:46,774 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:16:46,775 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:46,783 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:46,901 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:46,901 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:46,967 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:46,968 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:47,030 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:47,030 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:47,091 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:47,092 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:47,106 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:47,109 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:16:47,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:16:47,224 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1788 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1788))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1789)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 17:16:47,293 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (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 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1787))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1789)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 17:16:51,446 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-08 17:16:51,447 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:16:51,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178361107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:51,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:16:51,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 21 [2024-11-08 17:16:51,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273895624] [2024-11-08 17:16:51,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:16:51,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 17:16:51,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:51,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 17:16:51,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=565, Unknown=43, NotChecked=102, Total=812 [2024-11-08 17:16:51,560 INFO L87 Difference]: Start difference. First operand 617 states and 697 transitions. Second operand has 22 states, 20 states have (on average 6.25) internal successors, (125), 21 states have internal predecessors, (125), 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:16:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:54,858 INFO L93 Difference]: Finished difference Result 619 states and 701 transitions. [2024-11-08 17:16:54,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:16:54,858 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 6.25) internal successors, (125), 21 states have internal predecessors, (125), 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 100 [2024-11-08 17:16:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:54,860 INFO L225 Difference]: With dead ends: 619 [2024-11-08 17:16:54,861 INFO L226 Difference]: Without dead ends: 619 [2024-11-08 17:16:54,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=200, Invalid=1097, Unknown=43, NotChecked=142, Total=1482 [2024-11-08 17:16:54,862 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 499 mSDsluCounter, 3438 mSDsCounter, 0 mSdLazyCounter, 2824 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 3767 SdHoareTripleChecker+Invalid, 2841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:54,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 3767 Invalid, 2841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2824 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 17:16:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-08 17:16:54,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 616. [2024-11-08 17:16:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 450 states have (on average 1.531111111111111) internal successors, (689), 609 states have internal predecessors, (689), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:16:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 696 transitions. [2024-11-08 17:16:54,876 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 696 transitions. Word has length 100 [2024-11-08 17:16:54,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:54,876 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 696 transitions. [2024-11-08 17:16:54,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 6.25) internal successors, (125), 21 states have internal predecessors, (125), 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:16:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 696 transitions. [2024-11-08 17:16:54,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 17:16:54,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:54,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] [2024-11-08 17:16:54,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 17:16:55,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:55,079 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:16:55,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:55,079 INFO L85 PathProgramCache]: Analyzing trace with hash 149460743, now seen corresponding path program 1 times [2024-11-08 17:16:55,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:55,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874312057] [2024-11-08 17:16:55,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:55,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,389 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:16:56,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:56,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874312057] [2024-11-08 17:16:56,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874312057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:56,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398189574] [2024-11-08 17:16:56,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:56,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:56,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:16:56,394 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:16:56,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 17:16:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 17:16:56,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:16:56,881 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:16:56,896 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:16:56,897 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:56,953 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:56,964 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:57,115 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:57,120 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:57,292 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:57,293 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:57,298 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:57,426 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:57,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 17:16:57,444 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:57,561 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:57,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 17:16:57,572 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:57,676 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:16:57,676 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:57,683 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:57,720 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:57,729 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:57,770 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:16:57,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:16:57,877 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int))) (<= (+ 24 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1961) |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~mem55#1.base| v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1961 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 17:16:57,997 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1960) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1959) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (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))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1959))) (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~mem54#1.base| v_ArrVal_1960) .cse1 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-08 17:16:58,156 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)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1957))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1959))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1958) .cse0 v_ArrVal_1960) .cse1 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1957))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1958) .cse5 v_ArrVal_1960) (select (select (store .cse6 .cse5 v_ArrVal_1959) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1961))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-08 17:16:58,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_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)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1957))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1959))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 24 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1958) .cse1 v_ArrVal_1960) .cse2 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1957))) (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_1960) (select (select (store .cse7 .cse6 v_ArrVal_1959) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1961))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2024-11-08 17:16:58,304 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1967 (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)) (v_ArrVal_1968 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1967))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1957))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1959))) (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~mem51#1.base| v_ArrVal_1968) .cse0 v_ArrVal_1958) .cse1 v_ArrVal_1960) .cse2 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1967 (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)) (v_ArrVal_1968 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1967))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1957))) (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~mem51#1.base| v_ArrVal_1968) .cse7 v_ArrVal_1958) .cse8 v_ArrVal_1960) (select (select (store .cse9 .cse8 v_ArrVal_1959) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1961))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) is different from false [2024-11-08 17:16:58,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398189574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:58,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:16:58,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2024-11-08 17:16:58,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479095793] [2024-11-08 17:16:58,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:16:58,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 17:16:58,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:58,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 17:16:58,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=680, Unknown=28, NotChecked=290, Total=1122 [2024-11-08 17:16:58,310 INFO L87 Difference]: Start difference. First operand 616 states and 696 transitions. Second operand has 25 states, 22 states have (on average 6.090909090909091) internal successors, (134), 24 states have internal predecessors, (134), 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:17:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:03,744 INFO L93 Difference]: Finished difference Result 618 states and 700 transitions. [2024-11-08 17:17:03,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:17:03,745 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.090909090909091) internal successors, (134), 24 states have internal predecessors, (134), 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 100 [2024-11-08 17:17:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:03,747 INFO L225 Difference]: With dead ends: 618 [2024-11-08 17:17:03,747 INFO L226 Difference]: Without dead ends: 618 [2024-11-08 17:17:03,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=206, Invalid=1117, Unknown=29, NotChecked=370, Total=1722 [2024-11-08 17:17:03,749 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 482 mSDsluCounter, 3866 mSDsCounter, 0 mSdLazyCounter, 4573 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 4197 SdHoareTripleChecker+Invalid, 4594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:03,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 4197 Invalid, 4594 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 4573 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-08 17:17:03,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-08 17:17:03,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 600. [2024-11-08 17:17:03,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 436 states have (on average 1.5435779816513762) internal successors, (673), 594 states have internal predecessors, (673), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:17:03,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 679 transitions. [2024-11-08 17:17:03,760 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 679 transitions. Word has length 100 [2024-11-08 17:17:03,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:03,760 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 679 transitions. [2024-11-08 17:17:03,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.090909090909091) internal successors, (134), 24 states have internal predecessors, (134), 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:17:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 679 transitions. [2024-11-08 17:17:03,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 17:17:03,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:03,762 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:17:03,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 17:17:03,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-08 17:17:03,963 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:17:03,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:03,963 INFO L85 PathProgramCache]: Analyzing trace with hash 695798739, now seen corresponding path program 1 times [2024-11-08 17:17:03,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:03,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017428944] [2024-11-08 17:17:03,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:03,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:04,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:17:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:04,969 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:17:04,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:04,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017428944] [2024-11-08 17:17:04,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017428944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:17:04,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:17:04,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:17:04,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391173598] [2024-11-08 17:17:04,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:17:04,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 17:17:04,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:04,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 17:17:04,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:17:04,971 INFO L87 Difference]: Start difference. First operand 600 states and 679 transitions. Second operand has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 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:17:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:07,329 INFO L93 Difference]: Finished difference Result 623 states and 705 transitions. [2024-11-08 17:17:07,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:17:07,330 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 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:17:07,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:07,332 INFO L225 Difference]: With dead ends: 623 [2024-11-08 17:17:07,333 INFO L226 Difference]: Without dead ends: 623 [2024-11-08 17:17:07,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:17:07,334 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 492 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:07,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 2800 Invalid, 2177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2160 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 17:17:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-08 17:17:07,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 619. [2024-11-08 17:17:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 454 states have (on average 1.526431718061674) internal successors, (693), 612 states have internal predecessors, (693), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:17:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 700 transitions. [2024-11-08 17:17:07,344 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 700 transitions. Word has length 103 [2024-11-08 17:17:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:07,344 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 700 transitions. [2024-11-08 17:17:07,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 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:17:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 700 transitions. [2024-11-08 17:17:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 17:17:07,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:07,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] [2024-11-08 17:17:07,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 17:17:07,346 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:17:07,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:07,346 INFO L85 PathProgramCache]: Analyzing trace with hash 695798740, now seen corresponding path program 1 times [2024-11-08 17:17:07,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:07,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954307398] [2024-11-08 17:17:07,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:07,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:17:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,973 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:17:08,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:08,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954307398] [2024-11-08 17:17:08,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954307398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:17:08,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:17:08,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 17:17:08,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590689027] [2024-11-08 17:17:08,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:17:08,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:17:08,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:08,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:17:08,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:17:08,977 INFO L87 Difference]: Start difference. First operand 619 states and 700 transitions. Second operand has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:17:13,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:13,417 INFO L93 Difference]: Finished difference Result 622 states and 704 transitions. [2024-11-08 17:17:13,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:17:13,418 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-08 17:17:13,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:13,419 INFO L225 Difference]: With dead ends: 622 [2024-11-08 17:17:13,419 INFO L226 Difference]: Without dead ends: 622 [2024-11-08 17:17:13,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-08 17:17:13,420 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 488 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 3099 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:13,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 2983 Invalid, 3115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3099 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-08 17:17:13,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-08 17:17:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 619. [2024-11-08 17:17:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 454 states have (on average 1.524229074889868) internal successors, (692), 612 states have internal predecessors, (692), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:17:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 699 transitions. [2024-11-08 17:17:13,430 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 699 transitions. Word has length 103 [2024-11-08 17:17:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:13,431 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 699 transitions. [2024-11-08 17:17:13,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:17:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 699 transitions. [2024-11-08 17:17:13,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 17:17:13,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:13,432 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:17:13,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 17:17:13,433 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:17:13,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:13,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1505528120, now seen corresponding path program 1 times [2024-11-08 17:17:13,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:13,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638837356] [2024-11-08 17:17:13,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:13,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:14,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:17:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:14,497 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:17:14,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:14,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638837356] [2024-11-08 17:17:14,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638837356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:17:14,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305270106] [2024-11-08 17:17:14,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:14,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:17:14,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:17:14,499 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:17:14,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 17:17:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:14,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 17:17:14,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:17:14,968 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:17:14,969 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:17:14,976 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:17:15,089 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:17:15,089 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:17:15,130 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:17:15,130 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:17:15,204 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:17:15,204 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:17:15,278 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:17:15,279 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:17:15,367 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:17:15,367 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:17:15,392 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:17:15,422 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 17:17:15,422 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:17:15,426 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:17:15,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:17:16,700 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-08 17:17:16,700 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:17:16,725 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2309 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2309))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2302)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2303)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2304)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2305)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-08 17:17:16,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305270106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:17:16,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:17:16,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 21 [2024-11-08 17:17:16,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197808966] [2024-11-08 17:17:16,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:17:16,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 17:17:16,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:16,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 17:17:16,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=813, Unknown=43, NotChecked=60, Total=1056 [2024-11-08 17:17:16,731 INFO L87 Difference]: Start difference. First operand 619 states and 699 transitions. Second operand has 22 states, 20 states have (on average 6.2) internal successors, (124), 20 states have internal predecessors, (124), 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:17:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:20,373 INFO L93 Difference]: Finished difference Result 621 states and 703 transitions. [2024-11-08 17:17:20,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:17:20,374 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 6.2) internal successors, (124), 20 states have internal predecessors, (124), 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 104 [2024-11-08 17:17:20,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:20,376 INFO L225 Difference]: With dead ends: 621 [2024-11-08 17:17:20,376 INFO L226 Difference]: Without dead ends: 621 [2024-11-08 17:17:20,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=265, Invalid=1502, Unknown=43, NotChecked=82, Total=1892 [2024-11-08 17:17:20,378 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 475 mSDsluCounter, 4054 mSDsCounter, 0 mSdLazyCounter, 3286 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 4382 SdHoareTripleChecker+Invalid, 3302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:20,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 4382 Invalid, 3302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3286 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 17:17:20,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-08 17:17:20,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 618. [2024-11-08 17:17:20,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 454 states have (on average 1.5220264317180616) internal successors, (691), 611 states have internal predecessors, (691), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:17:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 698 transitions. [2024-11-08 17:17:20,391 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 698 transitions. Word has length 104 [2024-11-08 17:17:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:20,391 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 698 transitions. [2024-11-08 17:17:20,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 6.2) internal successors, (124), 20 states have internal predecessors, (124), 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:17:20,392 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 698 transitions. [2024-11-08 17:17:20,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 17:17:20,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:20,393 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:17:20,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 17:17:20,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-08 17:17:20,597 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:17:20,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:20,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1505528119, now seen corresponding path program 1 times [2024-11-08 17:17:20,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:20,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423075561] [2024-11-08 17:17:20,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:20,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:22,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:17:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:22,156 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:17:22,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:22,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423075561] [2024-11-08 17:17:22,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423075561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:17:22,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968686258] [2024-11-08 17:17:22,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:22,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:17:22,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:17:22,159 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:17:22,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 17:17:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:22,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-08 17:17:22,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:17:22,669 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:17:22,684 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:17:22,685 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:17:22,756 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:17:22,766 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:17:22,896 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:17:22,902 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:17:23,140 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:17:23,140 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:17:23,151 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:17:23,394 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:17:23,394 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:17:23,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:17:23,578 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:17:23,579 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:17:23,589 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:17:23,745 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:17:23,745 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:17:23,754 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:17:23,902 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:17:23,902 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:17:23,910 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:17:23,943 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:17:23,950 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:17:24,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:17:24,042 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-08 17:17:24,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-08 17:17:24,063 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:17:24,063 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:17:24,122 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:17:24,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:17:28,130 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |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|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))) (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2490))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2492))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2491) .cse1 v_ArrVal_2493) .cse2 v_ArrVal_2494) (select (select (store .cse3 .cse2 v_ArrVal_2495) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2497))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_2490 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_7| 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_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (or (forall ((v_ArrVal_2498 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2490))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2492))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2495))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2491) .cse6 v_ArrVal_2493) .cse7 v_ArrVal_2494) .cse8 v_ArrVal_2497) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2498) (select (select (store .cse9 .cse8 v_ArrVal_2496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))))))) is different from false [2024-11-08 17:17:28,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:17:28,319 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:17:28,821 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_19 (Array Int Int)) (v_prenex_20 (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_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_22))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_prenex_19))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_prenex_27))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_20) .cse0 v_prenex_28) .cse1 v_prenex_26) .cse2 v_prenex_25) (select (select (store .cse3 .cse2 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_23))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_7| |c_ULTIMATE.start_main_#t~mem51#1.base|) (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2504 (Array Int Int)) (v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2498 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_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2503))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2490))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2492))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2495))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2504) .cse7 v_ArrVal_2491) .cse8 v_ArrVal_2493) .cse9 v_ArrVal_2494) .cse10 v_ArrVal_2497) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2498) (select (select (store .cse11 .cse10 v_ArrVal_2496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2024-11-08 17:17:28,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968686258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:17:28,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:17:28,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2024-11-08 17:17:28,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745518653] [2024-11-08 17:17:28,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:17:28,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 17:17:28,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:28,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 17:17:28,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1501, Unknown=44, NotChecked=162, Total=1892 [2024-11-08 17:17:28,833 INFO L87 Difference]: Start difference. First operand 618 states and 698 transitions. Second operand has 32 states, 29 states have (on average 4.896551724137931) internal successors, (142), 30 states have internal predecessors, (142), 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:17:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:38,943 INFO L93 Difference]: Finished difference Result 620 states and 702 transitions. [2024-11-08 17:17:38,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 17:17:38,943 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 4.896551724137931) internal successors, (142), 30 states have internal predecessors, (142), 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:17:38,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:38,946 INFO L225 Difference]: With dead ends: 620 [2024-11-08 17:17:38,946 INFO L226 Difference]: Without dead ends: 620 [2024-11-08 17:17:38,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=340, Invalid=2594, Unknown=44, NotChecked=214, Total=3192 [2024-11-08 17:17:38,947 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 504 mSDsluCounter, 4297 mSDsCounter, 0 mSdLazyCounter, 5217 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 4624 SdHoareTripleChecker+Invalid, 5240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:38,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 4624 Invalid, 5240 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 5217 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2024-11-08 17:17:38,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-08 17:17:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 598. [2024-11-08 17:17:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 436 states have (on average 1.5389908256880733) internal successors, (671), 592 states have internal predecessors, (671), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:17:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 677 transitions. [2024-11-08 17:17:38,961 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 677 transitions. Word has length 104 [2024-11-08 17:17:38,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:38,962 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 677 transitions. [2024-11-08 17:17:38,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 4.896551724137931) internal successors, (142), 30 states have internal predecessors, (142), 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:17:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 677 transitions. [2024-11-08 17:17:38,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 17:17:38,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:38,963 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:17:38,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-08 17:17:39,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-08 17:17:39,164 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:17:39,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:39,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1028700594, now seen corresponding path program 1 times [2024-11-08 17:17:39,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:39,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204618125] [2024-11-08 17:17:39,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:39,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:40,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:17:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:40,123 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:17:40,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:40,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204618125] [2024-11-08 17:17:40,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204618125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:17:40,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:17:40,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 17:17:40,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536684653] [2024-11-08 17:17:40,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:17:40,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:17:40,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:40,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:17:40,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:17:40,126 INFO L87 Difference]: Start difference. First operand 598 states and 677 transitions. Second operand has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:17:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:44,436 INFO L93 Difference]: Finished difference Result 624 states and 706 transitions. [2024-11-08 17:17:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:17:44,437 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-08 17:17:44,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:44,440 INFO L225 Difference]: With dead ends: 624 [2024-11-08 17:17:44,440 INFO L226 Difference]: Without dead ends: 624 [2024-11-08 17:17:44,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-11-08 17:17:44,441 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 510 mSDsluCounter, 3146 mSDsCounter, 0 mSdLazyCounter, 2595 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 3476 SdHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:44,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 3476 Invalid, 2608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2595 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-08 17:17:44,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2024-11-08 17:17:44,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 620. [2024-11-08 17:17:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 457 states have (on average 1.5185995623632385) internal successors, (694), 613 states have internal predecessors, (694), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:17:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 701 transitions. [2024-11-08 17:17:44,452 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 701 transitions. Word has length 106 [2024-11-08 17:17:44,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:44,453 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 701 transitions. [2024-11-08 17:17:44,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:17:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 701 transitions. [2024-11-08 17:17:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 17:17:44,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:44,454 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:17:44,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 17:17:44,454 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:17:44,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1028700595, now seen corresponding path program 1 times [2024-11-08 17:17:44,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:44,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621030111] [2024-11-08 17:17:44,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:44,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:46,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:17:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:46,208 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:17:46,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:46,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621030111] [2024-11-08 17:17:46,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621030111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:17:46,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:17:46,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 17:17:46,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449256334] [2024-11-08 17:17:46,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:17:46,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 17:17:46,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:46,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 17:17:46,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:17:46,211 INFO L87 Difference]: Start difference. First operand 620 states and 701 transitions. Second operand has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:17:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:51,757 INFO L93 Difference]: Finished difference Result 623 states and 705 transitions. [2024-11-08 17:17:51,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:17:51,757 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-08 17:17:51,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:51,760 INFO L225 Difference]: With dead ends: 623 [2024-11-08 17:17:51,760 INFO L226 Difference]: Without dead ends: 623 [2024-11-08 17:17:51,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-11-08 17:17:51,761 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 488 mSDsluCounter, 2668 mSDsCounter, 0 mSdLazyCounter, 3105 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 2996 SdHoareTripleChecker+Invalid, 3121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:51,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 2996 Invalid, 3121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3105 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-08 17:17:51,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-08 17:17:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 620. [2024-11-08 17:17:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 457 states have (on average 1.5164113785557987) internal successors, (693), 613 states have internal predecessors, (693), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:17:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 700 transitions. [2024-11-08 17:17:51,775 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 700 transitions. Word has length 106 [2024-11-08 17:17:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:51,775 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 700 transitions. [2024-11-08 17:17:51,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:17:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 700 transitions. [2024-11-08 17:17:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 17:17:51,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:51,777 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:17:51,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 17:17:51,777 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:17:51,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:51,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1155886749, now seen corresponding path program 1 times [2024-11-08 17:17:51,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:51,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981955826] [2024-11-08 17:17:51,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:51,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:52,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:17:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:53,031 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:17:53,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:53,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981955826] [2024-11-08 17:17:53,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981955826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:17:53,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634665431] [2024-11-08 17:17:53,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:53,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:17:53,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:17:53,033 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:17:53,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 17:17:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:53,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 17:17:53,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:17:53,621 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:17:53,622 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:17:53,632 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:17:53,747 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:17: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:17:53,884 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:17:53,884 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:17:53,998 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:17:53,998 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:17:54,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:17:54,123 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:17:54,229 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:17:54,230 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:17:54,327 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:17:54,327 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:17:54,434 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:17:54,440 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:17:54,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:17:54,471 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-08 17:17:54,471 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:17:54,479 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2866 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem57#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2866) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-08 17:17:54,493 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2866 (Array Int Int))) (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))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-08 17:17:54,508 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2866 (Array Int Int)) (v_ArrVal_2865 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2865)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-08 17:17:54,519 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2866 (Array Int Int)) (v_ArrVal_2865 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2865))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-08 17:17:54,537 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2866 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2864 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2864))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2865)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-08 17:17:54,553 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2866 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2864 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (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_2864))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2865)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-08 17:17:54,722 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2866 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2864 (Array Int Int)) (v_ArrVal_2863 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2863))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2864)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2865)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-08 17:17:54,750 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2866 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2864 (Array Int Int)) (v_ArrVal_2863 (Array Int Int)) (v_ArrVal_2862 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2862))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2863)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2864)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2865)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-08 17:17:54,768 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2866 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2864 (Array Int Int)) (v_ArrVal_2863 (Array Int Int)) (v_ArrVal_2862 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (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|) .cse2) v_ArrVal_2862))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2863)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2864)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2865)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-08 17:17:54,827 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2866 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2864 (Array Int Int)) (v_ArrVal_2863 (Array Int Int)) (v_ArrVal_2862 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2869))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2862)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2863)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2864)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2865)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-08 17:17:54,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634665431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:17:54,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:17:54,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 22 [2024-11-08 17:17:54,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973797839] [2024-11-08 17:17:54,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:17:54,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 17:17:54,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:54,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 17:17:54,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=487, Unknown=17, NotChecked=530, Total=1122 [2024-11-08 17:17:54,832 INFO L87 Difference]: Start difference. First operand 620 states and 700 transitions. Second operand has 23 states, 21 states have (on average 6.190476190476191) internal successors, (130), 22 states have internal predecessors, (130), 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:18:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:18:00,525 INFO L93 Difference]: Finished difference Result 622 states and 704 transitions. [2024-11-08 17:18:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:18:00,526 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.190476190476191) internal successors, (130), 22 states have internal predecessors, (130), 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 107 [2024-11-08 17:18:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:18:00,528 INFO L225 Difference]: With dead ends: 622 [2024-11-08 17:18:00,528 INFO L226 Difference]: Without dead ends: 622 [2024-11-08 17:18:00,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=165, Invalid=980, Unknown=17, NotChecked=730, Total=1892 [2024-11-08 17:18:00,529 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 505 mSDsluCounter, 4703 mSDsCounter, 0 mSdLazyCounter, 3712 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 5033 SdHoareTripleChecker+Invalid, 3736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:18:00,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 5033 Invalid, 3736 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 3712 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-08 17:18:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-08 17:18:00,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 619. [2024-11-08 17:18:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 457 states have (on average 1.5142231947483589) internal successors, (692), 612 states have internal predecessors, (692), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:18:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 699 transitions. [2024-11-08 17:18:00,542 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 699 transitions. Word has length 107 [2024-11-08 17:18:00,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:18:00,542 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 699 transitions. [2024-11-08 17:18:00,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.190476190476191) internal successors, (130), 22 states have internal predecessors, (130), 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:18:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 699 transitions. [2024-11-08 17:18:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 17:18:00,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:18:00,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] [2024-11-08 17:18:00,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 17:18:00,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-08 17:18:00,745 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:18:00,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:18:00,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1155886750, now seen corresponding path program 1 times [2024-11-08 17:18:00,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:18:00,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63606066] [2024-11-08 17:18:00,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:18:00,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:18:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:18:02,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:18:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:18:02,729 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:18:02,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:18:02,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63606066] [2024-11-08 17:18:02,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63606066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:18:02,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098177779] [2024-11-08 17:18:02,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:18:02,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:18:02,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:18:02,734 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:18:02,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 17:18:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:18:03,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-08 17:18:03,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:18:03,948 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:18:03,971 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:18:03,971 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:18:04,100 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:18:04,124 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:18:04,487 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:18:04,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:18:04,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:18:04,940 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 67 treesize of output 39 [2024-11-08 17:18:04,956 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 39 treesize of output 20 [2024-11-08 17:18:05,466 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-08 17:18:05,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 73 [2024-11-08 17:18:05,481 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 39 treesize of output 20 [2024-11-08 17:18:05,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 17:18:05,829 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:18:05,829 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:18:05,835 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:18:06,054 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:18:06,054 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:18:06,060 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:18:06,288 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:18:06,289 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:18:06,296 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:18:06,585 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-08 17:18:06,585 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:18:06,632 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-08 17:18:06,632 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:18:06,825 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:18:06,826 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 88 treesize of output 79 [2024-11-08 17:18:06,841 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 52 treesize of output 16 [2024-11-08 17:18:07,089 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 44 treesize of output 20 [2024-11-08 17:18:07,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2024-11-08 17:18:07,114 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:18:07,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:18:17,625 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3066 (Array Int Int)) (v_ArrVal_3071 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_11| Int) (v_ArrVal_3067 (Array Int Int)) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem57#1.offset_13| Int) (v_ArrVal_3072 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3065)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_3066))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3064) .cse6 v_ArrVal_3067) .cse5 v_ArrVal_3069))) (or (< v_ArrVal_3071 0) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3068))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem57#1.offset_13| v_ArrVal_3071)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_11| v_ArrVal_3070) (select (select (store .cse3 .cse1 v_ArrVal_3072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< |v_ULTIMATE.start_main_#t~mem57#1.offset_13| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_11|) 0)) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem57#1.offset_13|)))))))) is different from false [2024-11-08 17:18:17,691 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3066 (Array Int Int)) (v_ArrVal_3071 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_11| Int) (v_ArrVal_3067 (Array Int Int)) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem57#1.offset_13| Int) (v_ArrVal_3072 (Array Int Int))) (let ((.cse2 (+ |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|) .cse2))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_3065))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_3066))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_3064) .cse7 v_ArrVal_3067) .cse5 v_ArrVal_3069))) (or (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3068))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem57#1.offset_13| v_ArrVal_3071)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_11| v_ArrVal_3070) (select (select (store .cse3 .cse1 v_ArrVal_3072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< v_ArrVal_3071 0) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem57#1.offset_13|) (< |v_ULTIMATE.start_main_#t~mem57#1.offset_13| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_11|) 0))))))))))) is different from false [2024-11-08 17:18:17,791 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 17:18:17,791 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 13 treesize of output 12 [2024-11-08 17:18:17,852 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_11| Int) (v_ArrVal_3072 (Array Int Int)) (v_ArrVal_3062 (Array Int Int)) (v_ArrVal_3063 (Array Int Int)) (v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3066 (Array Int Int)) (v_ArrVal_3071 Int) (v_ArrVal_3067 (Array Int Int)) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem57#1.offset_13| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3063)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3065))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_3066))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3062) .cse6 v_ArrVal_3064) .cse7 v_ArrVal_3067) .cse5 v_ArrVal_3069))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_11| |c_ULTIMATE.start_main_#t~mem53#1.base|) (< v_ArrVal_3071 0) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3068))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem57#1.offset_13| v_ArrVal_3071)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_11| v_ArrVal_3070) (select (select (store .cse3 .cse1 v_ArrVal_3072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem57#1.offset_13|) (< |v_ULTIMATE.start_main_#t~mem57#1.offset_13| 0)))))))))) is different from false [2024-11-08 17:18:17,924 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_11| Int) (v_ArrVal_3072 (Array Int Int)) (v_ArrVal_3062 (Array Int Int)) (v_ArrVal_3063 (Array Int Int)) (v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3066 (Array Int Int)) (v_ArrVal_3071 Int) (v_ArrVal_3067 (Array Int Int)) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem57#1.offset_13| 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))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3063))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3065))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse9 .cse8 v_ArrVal_3066))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3062) .cse7 v_ArrVal_3064) .cse8 v_ArrVal_3067) .cse6 v_ArrVal_3069))) (or (< v_ArrVal_3071 0) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_11| .cse0) (< (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem57#1.offset_13|) (< |v_ULTIMATE.start_main_#t~mem57#1.offset_13| 0) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_3068))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse1 .cse3 (store (select .cse1 .cse3) |v_ULTIMATE.start_main_#t~mem57#1.offset_13| v_ArrVal_3071)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_11| v_ArrVal_3070) (select (select (store .cse4 .cse3 v_ArrVal_3072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))))))) is different from false [2024-11-08 17:18:18,226 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_11| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_55| Int) (v_ArrVal_3072 (Array Int Int)) (v_ArrVal_3062 (Array Int Int)) (v_ArrVal_3063 (Array Int Int)) (v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3066 (Array Int Int)) (v_ArrVal_3071 Int) (v_ArrVal_3067 (Array Int Int)) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem57#1.offset_13| Int) (|v_#Ultimate.C_memset#1_#ptr.offset_29| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_55| |v_#Ultimate.C_memset#1_#ptr.offset_29|) 0))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3063))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3065))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse9 .cse8 v_ArrVal_3066))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3077) .cse6 v_ArrVal_3062) .cse7 v_ArrVal_3064) .cse8 v_ArrVal_3067) .cse5 v_ArrVal_3069))) (or (< 0 |v_#Ultimate.C_memset#1_#t~loopctr160_55|) (< |c_ULTIMATE.start_main_#t~mem51#1.offset| |v_#Ultimate.C_memset#1_#ptr.offset_29|) (< v_ArrVal_3071 0) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem57#1.offset_13|) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3068))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< (+ 43 (select (select (store .cse0 .cse2 (store (select .cse0 .cse2) |v_ULTIMATE.start_main_#t~mem57#1.offset_13| v_ArrVal_3071)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_11| v_ArrVal_3070) (select (select (store .cse3 .cse2 v_ArrVal_3072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (< |v_ULTIMATE.start_main_#t~mem57#1.offset_13| 0) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_11| .cse6)))))))))))) is different from false [2024-11-08 17:18:18,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098177779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:18:18,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:18:18,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2024-11-08 17:18:18,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886777824] [2024-11-08 17:18:18,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:18:18,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-08 17:18:18,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:18:18,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-08 17:18:18,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1942, Unknown=24, NotChecked=470, Total=2652 [2024-11-08 17:18:18,234 INFO L87 Difference]: Start difference. First operand 619 states and 699 transitions. Second operand has 38 states, 35 states have (on average 5.885714285714286) internal successors, (206), 37 states have internal predecessors, (206), 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:18:34,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:18:34,562 INFO L93 Difference]: Finished difference Result 627 states and 710 transitions. [2024-11-08 17:18:34,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-08 17:18:34,562 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 5.885714285714286) internal successors, (206), 37 states have internal predecessors, (206), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2024-11-08 17:18:34,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:18:34,564 INFO L225 Difference]: With dead ends: 627 [2024-11-08 17:18:34,565 INFO L226 Difference]: Without dead ends: 627 [2024-11-08 17:18:34,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=531, Invalid=4157, Unknown=24, NotChecked=690, Total=5402 [2024-11-08 17:18:34,568 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 1396 mSDsluCounter, 5598 mSDsCounter, 0 mSdLazyCounter, 7064 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1400 SdHoareTripleChecker+Valid, 5923 SdHoareTripleChecker+Invalid, 7112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 7064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:18:34,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1400 Valid, 5923 Invalid, 7112 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 7064 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2024-11-08 17:18:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-08 17:18:34,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 596. [2024-11-08 17:18:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 436 states have (on average 1.5344036697247707) internal successors, (669), 590 states have internal predecessors, (669), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:18:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 675 transitions. [2024-11-08 17:18:34,582 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 675 transitions. Word has length 107 [2024-11-08 17:18:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:18:34,583 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 675 transitions. [2024-11-08 17:18:34,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 5.885714285714286) internal successors, (206), 37 states have internal predecessors, (206), 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:18:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 675 transitions. [2024-11-08 17:18:34,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:18:34,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:18:34,584 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:18:34,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-08 17:18:34,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-08 17:18:34,786 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:18:34,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:18:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1428383386, now seen corresponding path program 1 times [2024-11-08 17:18:34,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:18:34,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055397833] [2024-11-08 17:18:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:18:34,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:18:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:18:35,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:18:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:18:35,848 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:18:35,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:18:35,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055397833] [2024-11-08 17:18:35,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055397833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:18:35,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:18:35,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 17:18:35,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124695756] [2024-11-08 17:18:35,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:18:35,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:18:35,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:18:35,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:18:35,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:18:35,851 INFO L87 Difference]: Start difference. First operand 596 states and 675 transitions. Second operand has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:18:39,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:18:39,395 INFO L93 Difference]: Finished difference Result 647 states and 731 transitions. [2024-11-08 17:18:39,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:18:39,396 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-08 17:18:39,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:18:39,398 INFO L225 Difference]: With dead ends: 647 [2024-11-08 17:18:39,398 INFO L226 Difference]: Without dead ends: 647 [2024-11-08 17:18:39,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2024-11-08 17:18:39,399 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 586 mSDsluCounter, 2297 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:18:39,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 2633 Invalid, 2091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 17:18:39,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-11-08 17:18:39,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 621. [2024-11-08 17:18:39,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 460 states have (on average 1.5108695652173914) internal successors, (695), 614 states have internal predecessors, (695), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:18:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 702 transitions. [2024-11-08 17:18:39,411 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 702 transitions. Word has length 109 [2024-11-08 17:18:39,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:18:39,411 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 702 transitions. [2024-11-08 17:18:39,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:18:39,412 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 702 transitions. [2024-11-08 17:18:39,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:18:39,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:18:39,413 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:18:39,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-08 17:18:39,414 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:18:39,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:18:39,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1428383387, now seen corresponding path program 1 times [2024-11-08 17:18:39,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:18:39,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680921379] [2024-11-08 17:18:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:18:39,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:18:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:18:41,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:18:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:18:41,074 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:18:41,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:18:41,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680921379] [2024-11-08 17:18:41,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680921379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:18:41,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:18:41,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 17:18:41,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883709275] [2024-11-08 17:18:41,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:18:41,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 17:18:41,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:18:41,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 17:18:41,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:18:41,078 INFO L87 Difference]: Start difference. First operand 621 states and 702 transitions. Second operand has 17 states, 16 states have (on average 6.6875) internal successors, (107), 16 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:18:46,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:18:46,285 INFO L93 Difference]: Finished difference Result 646 states and 730 transitions. [2024-11-08 17:18:46,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:18:46,286 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.6875) internal successors, (107), 16 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-08 17:18:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:18:46,289 INFO L225 Difference]: With dead ends: 646 [2024-11-08 17:18:46,289 INFO L226 Difference]: Without dead ends: 646 [2024-11-08 17:18:46,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2024-11-08 17:18:46,290 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 539 mSDsluCounter, 3026 mSDsCounter, 0 mSdLazyCounter, 2943 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 3358 SdHoareTripleChecker+Invalid, 2959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:18:46,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 3358 Invalid, 2959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2943 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-08 17:18:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-08 17:18:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 621. [2024-11-08 17:18:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 460 states have (on average 1.508695652173913) internal successors, (694), 614 states have internal predecessors, (694), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:18:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 701 transitions. [2024-11-08 17:18:46,303 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 701 transitions. Word has length 109 [2024-11-08 17:18:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:18:46,304 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 701 transitions. [2024-11-08 17:18:46,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.6875) internal successors, (107), 16 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:18:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 701 transitions. [2024-11-08 17:18:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 17:18:46,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:18:46,306 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:18:46,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-08 17:18:46,307 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:18:46,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:18:46,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2024995377, now seen corresponding path program 1 times [2024-11-08 17:18:46,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:18:46,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496625597] [2024-11-08 17:18:46,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:18:46,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:18:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:18:47,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:18:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:18:47,290 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:18:47,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:18:47,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496625597] [2024-11-08 17:18:47,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496625597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:18:47,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:18:47,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:18:47,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260265556] [2024-11-08 17:18:47,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:18:47,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:18:47,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:18:47,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:18:47,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:18:47,296 INFO L87 Difference]: Start difference. First operand 621 states and 701 transitions. Second operand has 11 states, 10 states have (on average 10.8) internal successors, (108), 10 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:18:50,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:18:50,788 INFO L93 Difference]: Finished difference Result 637 states and 719 transitions. [2024-11-08 17:18:50,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:18:50,789 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.8) internal successors, (108), 10 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:18:50,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:18:50,791 INFO L225 Difference]: With dead ends: 637 [2024-11-08 17:18:50,791 INFO L226 Difference]: Without dead ends: 637 [2024-11-08 17:18:50,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:18:50,792 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 555 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 1855 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:18:50,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 2538 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1855 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 17:18:50,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-08 17:18:50,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 620. [2024-11-08 17:18:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 460 states have (on average 1.5065217391304349) internal successors, (693), 613 states have internal predecessors, (693), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:18:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 700 transitions. [2024-11-08 17:18:50,804 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 700 transitions. Word has length 110 [2024-11-08 17:18:50,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:18:50,805 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 700 transitions. [2024-11-08 17:18:50,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.8) internal successors, (108), 10 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:18:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 700 transitions. [2024-11-08 17:18:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 17:18:50,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:18:50,807 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:18:50,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-08 17:18:50,807 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:18:50,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:18:50,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2024995376, now seen corresponding path program 1 times [2024-11-08 17:18:50,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:18:50,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998590580] [2024-11-08 17:18:50,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:18:50,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:18:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:18:52,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:18:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:18:52,949 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:18:52,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:18:52,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998590580] [2024-11-08 17:18:52,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998590580] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:18:52,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225106987] [2024-11-08 17:18:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:18:52,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:18:52,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:18:52,953 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:18:52,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 17:18:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:18:53,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-08 17:18:53,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:18:54,087 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:18:54,087 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:18:54,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 19 treesize of output 1 [2024-11-08 17:18:54,168 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:18:54,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-08 17:18:54,504 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memset#1_#t~loopctr160_56| Int)) (and (<= |v_#Ultimate.C_memset#1_#t~loopctr160_56| 0) (= (store |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base| (store (select |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_56| |c_#Ultimate.C_memset#1_#ptr.offset|) 0)) |c_#memory_$Pointer$#1.base|))) is different from true [2024-11-08 17:18:54,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:18:54,552 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 36 treesize of output 26 [2024-11-08 17:18:54,896 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-08 17:18:54,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 39 [2024-11-08 17:18:55,089 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:18:55,090 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:18:55,219 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:18:55,219 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:18:55,350 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:18:55,351 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:18:55,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:18:55,529 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:18:55,535 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:18:55,815 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:18:55,815 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:18:55,825 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:18:55,981 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:18:55,989 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:18:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-08 17:18:56,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:18:56,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:18:56,277 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 46 treesize of output 50 [2024-11-08 17:18:56,334 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3568 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem59#1.base|)) (forall ((v_prenex_29 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_prenex_29) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ 41 |c_ULTIMATE.start_main_#t~mem59#1.offset|))) (forall ((v_ArrVal_3569 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-08 17:18:56,368 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_prenex_29 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_29) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ 41 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3569 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3568 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0))))) is different from false [2024-11-08 17:18:56,650 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 640 treesize of output 598 [2024-11-08 17:18:56,661 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 232 treesize of output 224 [2024-11-08 17:18:56,670 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 224 treesize of output 220 [2024-11-08 17:18:56,678 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 220 treesize of output 216 [2024-11-08 17:18:56,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 208 [2024-11-08 17:18:57,256 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3564 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-08 17:18:57,277 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3563 (Array Int Int)) (v_ArrVal_3564 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3563))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3564)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-08 17:19:06,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225106987] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:19:06,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:19:06,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 38 [2024-11-08 17:19:06,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368693166] [2024-11-08 17:19:06,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:19:06,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-08 17:19:06,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:19:06,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-08 17:19:06,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2010, Unknown=35, NotChecked=480, Total=2756 [2024-11-08 17:19:06,062 INFO L87 Difference]: Start difference. First operand 620 states and 700 transitions. Second operand has 39 states, 36 states have (on average 5.916666666666667) internal successors, (213), 38 states have internal predecessors, (213), 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:19:17,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:19:17,900 INFO L93 Difference]: Finished difference Result 645 states and 730 transitions. [2024-11-08 17:19:17,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 17:19:17,901 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 5.916666666666667) internal successors, (213), 38 states have internal predecessors, (213), 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 110 [2024-11-08 17:19:17,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:19:17,904 INFO L225 Difference]: With dead ends: 645 [2024-11-08 17:19:17,904 INFO L226 Difference]: Without dead ends: 645 [2024-11-08 17:19:17,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=465, Invalid=3678, Unknown=37, NotChecked=650, Total=4830 [2024-11-08 17:19:17,906 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1091 mSDsluCounter, 5974 mSDsCounter, 0 mSdLazyCounter, 5437 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 6297 SdHoareTripleChecker+Invalid, 6074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 5437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 571 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:19:17,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 6297 Invalid, 6074 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 5437 Invalid, 0 Unknown, 571 Unchecked, 10.0s Time] [2024-11-08 17:19:17,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-11-08 17:19:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 594. [2024-11-08 17:19:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 436 states have (on average 1.5298165137614679) internal successors, (667), 588 states have internal predecessors, (667), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:19:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 673 transitions. [2024-11-08 17:19:17,917 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 673 transitions. Word has length 110 [2024-11-08 17:19:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:19:17,918 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 673 transitions. [2024-11-08 17:19:17,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 5.916666666666667) internal successors, (213), 38 states have internal predecessors, (213), 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:19:17,918 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 673 transitions. [2024-11-08 17:19:17,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 17:19:17,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:19:17,919 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, 1] [2024-11-08 17:19:17,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-08 17:19:18,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:19:18,121 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:19:18,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:19:18,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1565852090, now seen corresponding path program 1 times [2024-11-08 17:19:18,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:19:18,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810077591] [2024-11-08 17:19:18,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:19:18,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:19:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:19:18,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:19:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:19:18,397 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:19:18,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:19:18,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810077591] [2024-11-08 17:19:18,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810077591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:19:18,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:19:18,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:19:18,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313639695] [2024-11-08 17:19:18,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:19:18,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:19:18,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:19:18,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:19:18,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:19:18,400 INFO L87 Difference]: Start difference. First operand 594 states and 673 transitions. Second operand has 6 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:19:19,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:19:19,891 INFO L93 Difference]: Finished difference Result 613 states and 695 transitions. [2024-11-08 17:19:19,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:19:19,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-08 17:19:19,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:19:19,893 INFO L225 Difference]: With dead ends: 613 [2024-11-08 17:19:19,893 INFO L226 Difference]: Without dead ends: 613 [2024-11-08 17:19:19,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:19:19,894 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 22 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1962 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:19:19,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1962 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 17:19:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-08 17:19:19,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 593. [2024-11-08 17:19:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 436 states have (on average 1.5275229357798166) internal successors, (666), 587 states have internal predecessors, (666), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:19:19,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 672 transitions. [2024-11-08 17:19:19,906 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 672 transitions. Word has length 112 [2024-11-08 17:19:19,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:19:19,906 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 672 transitions. [2024-11-08 17:19:19,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:19:19,907 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 672 transitions. [2024-11-08 17:19:19,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 17:19:19,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:19:19,908 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, 1] [2024-11-08 17:19:19,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-08 17:19:19,908 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:19:19,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:19:19,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1565852089, now seen corresponding path program 1 times [2024-11-08 17:19:19,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:19:19,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440947521] [2024-11-08 17:19:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:19:19,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:19:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:19:20,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:19:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:19:20,312 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:19:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:19:20,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440947521] [2024-11-08 17:19:20,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440947521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:19:20,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:19:20,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:19:20,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615902425] [2024-11-08 17:19:20,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:19:20,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:19:20,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:19:20,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:19:20,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:19:20,316 INFO L87 Difference]: Start difference. First operand 593 states and 672 transitions. Second operand has 6 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:19:21,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:19:21,829 INFO L93 Difference]: Finished difference Result 612 states and 694 transitions. [2024-11-08 17:19:21,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:19:21,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-08 17:19:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:19:21,831 INFO L225 Difference]: With dead ends: 612 [2024-11-08 17:19:21,831 INFO L226 Difference]: Without dead ends: 612 [2024-11-08 17:19:21,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:19:21,832 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 21 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:19:21,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1968 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 17:19:21,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-08 17:19:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 592. [2024-11-08 17:19:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 436 states have (on average 1.525229357798165) internal successors, (665), 586 states have internal predecessors, (665), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:19:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 671 transitions. [2024-11-08 17:19:21,841 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 671 transitions. Word has length 112 [2024-11-08 17:19:21,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:19:21,842 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 671 transitions. [2024-11-08 17:19:21,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:19:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 671 transitions. [2024-11-08 17:19:21,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 17:19:21,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:19:21,843 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, 1, 1] [2024-11-08 17:19:21,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-08 17:19:21,843 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:19:21,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:19:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1296773858, now seen corresponding path program 1 times [2024-11-08 17:19:21,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:19:21,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731704933] [2024-11-08 17:19:21,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:19:21,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:19:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:19:24,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:19:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:19:24,252 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:19:24,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:19:24,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731704933] [2024-11-08 17:19:24,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731704933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:19:24,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:19:24,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-08 17:19:24,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258986075] [2024-11-08 17:19:24,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:19:24,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 17:19:24,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:19:24,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 17:19:24,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:19:24,255 INFO L87 Difference]: Start difference. First operand 592 states and 671 transitions. Second operand has 22 states, 21 states have (on average 5.285714285714286) internal successors, (111), 21 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:19:29,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:19:29,802 INFO L93 Difference]: Finished difference Result 640 states and 724 transitions. [2024-11-08 17:19:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 17:19:29,803 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.285714285714286) internal successors, (111), 21 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-11-08 17:19:29,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:19:29,805 INFO L225 Difference]: With dead ends: 640 [2024-11-08 17:19:29,805 INFO L226 Difference]: Without dead ends: 640 [2024-11-08 17:19:29,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 17:19:29,806 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 598 mSDsluCounter, 3456 mSDsCounter, 0 mSdLazyCounter, 2919 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 3782 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:19:29,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 3782 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2919 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-08 17:19:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-08 17:19:29,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 621. [2024-11-08 17:19:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 464 states have (on average 1.4956896551724137) internal successors, (694), 614 states have internal predecessors, (694), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 17:19:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 703 transitions. [2024-11-08 17:19:29,817 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 703 transitions. Word has length 113 [2024-11-08 17:19:29,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:19:29,818 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 703 transitions. [2024-11-08 17:19:29,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.285714285714286) internal successors, (111), 21 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:19:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 703 transitions. [2024-11-08 17:19:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 17:19:29,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:19:29,820 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, 1, 1] [2024-11-08 17:19:29,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-08 17:19:29,820 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:19:29,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:19:29,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1296773857, now seen corresponding path program 1 times [2024-11-08 17:19:29,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:19:29,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010774266] [2024-11-08 17:19:29,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:19:29,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:19:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:19:32,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:19:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:19:32,467 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:19:32,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:19:32,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010774266] [2024-11-08 17:19:32,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010774266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:19:32,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:19:32,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 17:19:32,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058024074] [2024-11-08 17:19:32,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:19:32,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 17:19:32,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:19:32,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 17:19:32,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:19:32,470 INFO L87 Difference]: Start difference. First operand 621 states and 703 transitions. Second operand has 20 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:19:39,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:19:39,595 INFO L93 Difference]: Finished difference Result 639 states and 723 transitions. [2024-11-08 17:19:39,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 17:19:39,596 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-11-08 17:19:39,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:19:39,599 INFO L225 Difference]: With dead ends: 639 [2024-11-08 17:19:39,599 INFO L226 Difference]: Without dead ends: 639 [2024-11-08 17:19:39,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 17:19:39,600 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 520 mSDsluCounter, 3662 mSDsCounter, 0 mSdLazyCounter, 3691 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 3986 SdHoareTripleChecker+Invalid, 3713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:19:39,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 3986 Invalid, 3713 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 3691 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-08 17:19:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-08 17:19:39,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 621. [2024-11-08 17:19:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 463 states have (on average 1.4967602591792657) internal successors, (693), 614 states have internal predecessors, (693), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 17:19:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 702 transitions. [2024-11-08 17:19:39,613 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 702 transitions. Word has length 113 [2024-11-08 17:19:39,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:19:39,614 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 702 transitions. [2024-11-08 17:19:39,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:19:39,614 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 702 transitions. [2024-11-08 17:19:39,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 17:19:39,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:19:39,615 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, 1, 1, 1] [2024-11-08 17:19:39,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-08 17:19:39,616 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:19:39,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:19:39,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1809959379, now seen corresponding path program 1 times [2024-11-08 17:19:39,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:19:39,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573781876] [2024-11-08 17:19:39,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:19:39,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:19:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:19:41,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:19:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:19:41,902 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:19:41,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:19:41,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573781876] [2024-11-08 17:19:41,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573781876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:19:41,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724823028] [2024-11-08 17:19:41,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:19:41,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:19:41,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:19:41,905 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:19:41,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 17:19:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:19:42,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-08 17:19:42,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:19:42,559 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:19:42,559 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:19:42,638 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:19:42,645 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:19:42,922 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:19:42,923 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:19:42,930 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:19:43,047 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:19:43,047 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:19:43,053 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:19:43,161 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:19:43,161 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:19:43,167 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:19:43,279 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:19:43,279 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:19:43,285 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:19:43,397 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:19:43,398 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:19:43,403 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:19:43,520 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:19:43,647 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-08 17:19:43,648 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:19:43,654 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:19:43,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:19:43,906 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-08 17:19:43,906 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:19:43,914 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:19:43,965 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:19:44,083 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-08 17:19:44,083 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:19:44,089 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:19:44,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:19:44,133 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int))) (or (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4145))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) 1) (not (= v_ArrVal_4145 (let ((.cse2 (+ 40 |c_ULTIMATE.start_main_#t~mem59#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base|) .cse2 (select v_ArrVal_4145 .cse2))))))) is different from false [2024-11-08 17:19:44,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select |c_#memory_$Pointer$#1.base| .cse1) .cse2 (select v_ArrVal_4145 .cse2))) v_ArrVal_4145)) (= (select |c_#valid| (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4145))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1))))) is different from false [2024-11-08 17:19:44,250 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4143 (Array Int Int)) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4143)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4145 .cse4))) v_ArrVal_4145)) (= (select |c_#valid| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4145))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1))))) is different from false [2024-11-08 17:19:44,268 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:19:44,324 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_16|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4143)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4145 .cse4))) v_ArrVal_4145)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4145))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-08 17:19:44,373 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4143)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4145))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4145 .cse5))) v_ArrVal_4145)))))))) is different from false [2024-11-08 17:19:44,495 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4140 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4140)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4141))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4143)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4145))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4145 .cse5))) v_ArrVal_4145)))))))) is different from false [2024-11-08 17:19:44,576 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4140 (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 ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4140))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4141))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4143))) (or (not (= v_ArrVal_4145 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4145 .cse2))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4145))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) is different from false [2024-11-08 17:19:44,848 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4139 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4140 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4138)) (.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_4140))) (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~mem55#1.base| v_ArrVal_4139) .cse9 v_ArrVal_4141))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4143)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_4145 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4145 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4145))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-08 17:19:44,913 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4139 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4140 (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_4138))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4140))) (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_4139) .cse10 v_ArrVal_4141))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4143)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4145 (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4145 .cse4))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4145))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-11-08 17:19:45,067 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (v_ArrVal_4136 (Array Int Int)) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4139 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4140 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4137)) (.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_4138))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4140))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4136) .cse9 v_ArrVal_4139) .cse10 v_ArrVal_4141))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4143)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4145 .cse4))) v_ArrVal_4145)) (= (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4145))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|))))))))))) is different from false [2024-11-08 17:19:45,144 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (v_ArrVal_4136 (Array Int Int)) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4139 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4140 (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_4137))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4138))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4140))) (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_4136) .cse10 v_ArrVal_4139) .cse11 v_ArrVal_4141))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4143))) (or (not (= v_ArrVal_4145 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4145 .cse2))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4145))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) is different from false [2024-11-08 17:19:45,299 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4140 (Array Int Int)) (v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (v_ArrVal_4134 (Array Int Int)) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4135 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (v_ArrVal_4136 (Array Int Int)) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4139 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4135)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4137))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4138))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4140))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4134) .cse9 v_ArrVal_4136) .cse10 v_ArrVal_4139) .cse11 v_ArrVal_4141))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4143))) (or (not (= v_ArrVal_4145 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4145 .cse2))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4145))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) is different from false [2024-11-08 17:19:45,383 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4140 (Array Int Int)) (v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (v_ArrVal_4134 (Array Int Int)) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4135 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (v_ArrVal_4136 (Array Int Int)) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4139 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4135))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4137))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4138))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4140))) (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_4134) .cse10 v_ArrVal_4136) .cse11 v_ArrVal_4139) .cse12 v_ArrVal_4141))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4143))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4145))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4145 .cse5))) v_ArrVal_4145)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-11-08 17:19:45,703 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4151 (Array Int Int)) (v_ArrVal_4140 (Array Int Int)) (v_ArrVal_4152 (Array Int Int)) (v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (v_ArrVal_4134 (Array Int Int)) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4135 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (v_ArrVal_4136 (Array Int Int)) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4139 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4151)) (.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_4135))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4137))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4138))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4140))) (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~mem51#1.base| v_ArrVal_4152) .cse9 v_ArrVal_4134) .cse10 v_ArrVal_4136) .cse11 v_ArrVal_4139) .cse12 v_ArrVal_4141))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4143))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4145))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4145 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4145 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-11-08 17:19:45,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724823028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:19:45,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:19:45,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 33 [2024-11-08 17:19:45,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026941271] [2024-11-08 17:19:45,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:19:45,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 17:19:45,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:19:45,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 17:19:45,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1024, Unknown=14, NotChecked=1078, Total=2256 [2024-11-08 17:19:45,719 INFO L87 Difference]: Start difference. First operand 621 states and 702 transitions. Second operand has 34 states, 31 states have (on average 5.064516129032258) internal successors, (157), 33 states have internal predecessors, (157), 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:19:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:19:52,439 INFO L93 Difference]: Finished difference Result 637 states and 721 transitions. [2024-11-08 17:19:52,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 17:19:52,439 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 5.064516129032258) internal successors, (157), 33 states have internal predecessors, (157), 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 114 [2024-11-08 17:19:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:19:52,441 INFO L225 Difference]: With dead ends: 637 [2024-11-08 17:19:52,442 INFO L226 Difference]: Without dead ends: 637 [2024-11-08 17:19:52,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=258, Invalid=2040, Unknown=14, NotChecked=1470, Total=3782 [2024-11-08 17:19:52,444 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 553 mSDsluCounter, 5047 mSDsCounter, 0 mSdLazyCounter, 4057 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 5373 SdHoareTripleChecker+Invalid, 4084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:19:52,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 5373 Invalid, 4084 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 4057 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-08 17:19:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-08 17:19:52,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 620. [2024-11-08 17:19:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 463 states have (on average 1.4946004319654427) internal successors, (692), 613 states have internal predecessors, (692), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 17:19:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 701 transitions. [2024-11-08 17:19:52,450 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 701 transitions. Word has length 114 [2024-11-08 17:19:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:19:52,450 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 701 transitions. [2024-11-08 17:19:52,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 5.064516129032258) internal successors, (157), 33 states have internal predecessors, (157), 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:19:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 701 transitions. [2024-11-08 17:19:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 17:19:52,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:19:52,452 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, 1, 1, 1] [2024-11-08 17:19:52,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-08 17:19:52,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-08 17:19:52,652 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:19:52,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:19:52,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1809959380, now seen corresponding path program 1 times [2024-11-08 17:19:52,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:19:52,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244208144] [2024-11-08 17:19:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:19:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:19:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:19:55,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:19:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:19:55,466 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:19:55,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:19:55,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244208144] [2024-11-08 17:19:55,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244208144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:19:55,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817348818] [2024-11-08 17:19:55,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:19:55,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:19:55,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:19:55,470 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:19:55,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-08 17:19:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:19:55,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-08 17:19:55,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:19:56,155 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:19:56,155 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:19:56,217 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:19:56,222 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:19:56,420 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:19:56,420 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:19:56,426 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:19:56,531 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:19:56,531 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:19:56,537 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:19:56,647 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:19:56,647 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:19:56,652 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:19:56,760 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:19:56,760 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:19:56,765 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:19:56,880 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:19:56,881 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:19:56,889 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:19:57,005 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:19:57,133 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-08 17:19:57,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 72 [2024-11-08 17:19:57,139 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:19:57,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:19:57,440 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-08 17:19:57,440 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:19:57,471 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-08 17:19:57,471 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:19:57,839 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-08 17:19:57,839 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:19:57,925 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:19:57,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:19:58,318 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base|)) (.cse3 (+ 40 |c_ULTIMATE.start_main_#t~mem59#1.offset|))) (and (forall ((v_ArrVal_4370 (Array Int Int))) (or (forall ((v_ArrVal_4369 Int)) (<= 0 (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| (store .cse2 .cse3 v_ArrVal_4369)))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (not (= (store .cse4 .cse3 (select v_ArrVal_4370 .cse3)) v_ArrVal_4370)))) (forall ((v_ArrVal_4370 (Array Int Int))) (or (not (= (store .cse4 .cse3 (select v_ArrVal_4370 .cse3)) v_ArrVal_4370)) (forall ((v_ArrVal_4369 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| (store .cse2 .cse3 v_ArrVal_4369))) (.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4370))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select .cse5 .cse6) .cse7) 384) (select |c_#length| (select (select .cse8 .cse6) .cse7)))))))))) is different from false [2024-11-08 17:19:58,392 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse6 (select |c_#memory_$Pointer$#1.offset| .cse5))) (and (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (forall ((v_ArrVal_4370 (Array Int Int))) (let ((.cse7 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (forall ((v_ArrVal_4369 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse5 (store .cse6 .cse7 v_ArrVal_4369))) (.cse3 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_4370))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select .cse0 .cse1) .cse2) 384) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (= v_ArrVal_4370 (store .cse8 .cse7 (select v_ArrVal_4370 .cse7))))))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse9))) (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse9) (forall ((v_ArrVal_4370 (Array Int Int))) (let ((.cse10 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4370 (store .cse8 .cse10 (select v_ArrVal_4370 .cse10)))) (forall ((v_ArrVal_4369 Int)) (<= 0 (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse5 (store .cse6 .cse10 v_ArrVal_4369)))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) is different from false [2024-11-08 17:19:58,525 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.base|))) (.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.offset|)))) (let ((.cse8 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse5 (select .cse4 .cse2)) (.cse7 (select .cse1 .cse2))) (and (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (forall ((v_ArrVal_4370 (Array Int Int))) (let ((.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (forall ((v_ArrVal_4369 Int)) (<= 0 (let ((.cse0 (store .cse4 .cse2 (store .cse5 .cse6 v_ArrVal_4369)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (not (= (store .cse7 .cse6 (select v_ArrVal_4370 .cse6)) v_ArrVal_4370))))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse8))) (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse8) (forall ((v_ArrVal_4370 (Array Int Int))) (let ((.cse13 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (forall ((v_ArrVal_4369 Int)) (let ((.cse9 (store .cse4 .cse2 (store .cse5 .cse13 v_ArrVal_4369))) (.cse12 (store .cse1 .cse2 v_ArrVal_4370))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse11 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 384 (select (select .cse9 .cse10) .cse11)) (select |c_#length| (select (select .cse12 .cse10) .cse11)))))) (not (= (store .cse7 .cse13 (select v_ArrVal_4370 .cse13)) v_ArrVal_4370))))))))))) is different from false [2024-11-08 17:19:58,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 942 treesize of output 820 [2024-11-08 17:19:58,847 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| 0))) (.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|))) (and (forall ((v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse5 v_ArrVal_4369)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1) (not (= (store (select .cse1 .cse2) .cse5 (select v_ArrVal_4370 .cse5)) v_ArrVal_4370)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse6))))) (forall ((v_prenex_34 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse11 (+ 40 v_prenex_35))) (or (< 0 (+ (let ((.cse8 (store .cse4 .cse10 (store (select .cse4 .cse10) .cse11 v_prenex_34)))) (select (select .cse8 (select (select (store .cse9 .cse10 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1)) (not (= (store (select .cse9 .cse10) .cse11 (select v_prenex_36 .cse11)) v_prenex_36)) (< v_prenex_35 .cse6))))) (forall ((v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse15 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse12 (store .cse13 .cse14 v_ArrVal_4370))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse4 .cse14 (store (select .cse4 .cse14) .cse15 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (not (= (store (select .cse13 .cse14) .cse15 (select v_ArrVal_4370 .cse15)) v_ArrVal_4370)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse6)))))))) is different from false [2024-11-08 17:19:59,852 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4363)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4362))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse5 v_ArrVal_4369)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_ArrVal_4370 (store (select .cse1 .cse2) .cse5 (select v_ArrVal_4370 .cse5)))))))))) (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4363)) (.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4362))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse17 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse13 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 0))) (.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse14 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_4370))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse13 .cse12 (store (select .cse13 .cse12) .cse14 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_ArrVal_4370 (store (select .cse11 .cse12) .cse14 (select v_ArrVal_4370 .cse14)))))))))) (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_prenex_34 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int)) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4363)) (.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4362))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse20 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse19 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse22 (+ 40 v_prenex_35))) (or (< v_prenex_35 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (select .cse20 .cse21) .cse22 (select v_prenex_36 .cse22)) v_prenex_36)) (< 0 (+ (let ((.cse23 (store .cse19 .cse21 (store (select .cse19 .cse21) .cse22 v_prenex_34)))) (select (select .cse23 (select (select (store .cse20 .cse21 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1)))))))))) is different from false [2024-11-08 17:20:00,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_prenex_34 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_4363)) (.cse6 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_4362))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 v_prenex_35))) (or (< v_prenex_35 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse3 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_prenex_34)))) (select (select .cse2 (select (select (store .cse3 .cse4 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (not (= v_prenex_36 (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4362 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_36 .cse5))))))))) (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_4363)) (.cse13 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_4362))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse15 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse20 (store .cse21 .cse14 (store (select .cse21 .cse14) .cse15 0)))) (or (not (= (store (let ((.cse12 (store .cse13 .cse14 (store v_ArrVal_4362 .cse15 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse16 (select v_ArrVal_4370 .cse16)) v_ArrVal_4370)) (< (let ((.cse18 (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store .cse20 .cse19 (store (select .cse20 .cse19) .cse16 v_ArrVal_4369)))) (select (select .cse17 (select (select (store .cse18 .cse19 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_4363)) (.cse30 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_4362))) (let ((.cse28 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse29 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store .cse30 .cse28 (store (select .cse30 .cse28) .cse29 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse25 (store .cse27 .cse28 (store (select .cse27 .cse28) .cse29 0))) (.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse24 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= (store (select .cse22 .cse23) .cse24 (select v_ArrVal_4370 .cse24)) v_ArrVal_4370)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse26 (store .cse22 .cse23 v_ArrVal_4370))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse25 .cse23 (store (select .cse25 .cse23) .cse24 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-08 17:20:03,562 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_prenex_34 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4360 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4360))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4361) .cse12 v_ArrVal_4363)) (.cse6 (store .cse11 .cse12 v_ArrVal_4362))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 v_prenex_35))) (or (< v_prenex_35 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse3 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_prenex_34)))) (select (select .cse2 (select (select (store .cse3 .cse4 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (not (= (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4362 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_36 .cse5)) v_prenex_36))))))))) (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4360))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse18 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4361) .cse23 v_ArrVal_4363)) (.cse21 (store .cse22 .cse23 v_ArrVal_4362))) (let ((.cse19 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse21 .cse19 (store (select .cse21 .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse16 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 0))) (.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse15 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4370 (store (select .cse13 .cse14) .cse15 (select v_ArrVal_4370 .cse15)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse17 (store .cse13 .cse14 v_ArrVal_4370))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse16 .cse14 (store (select .cse16 .cse14) .cse15 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4360))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4361) .cse35 v_ArrVal_4363)) (.cse25 (store .cse34 .cse35 v_ArrVal_4362))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse27 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse29 (store .cse33 .cse26 (store (select .cse33 .cse26) .cse27 0))) (.cse28 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4370 (store (let ((.cse24 (store .cse25 .cse26 (store v_ArrVal_4362 .cse27 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse28 (select v_ArrVal_4370 .cse28)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse31 (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse32 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse30 (store .cse29 .cse32 (store (select .cse29 .cse32) .cse28 v_ArrVal_4369)))) (select (select .cse30 (select (select (store .cse31 .cse32 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)))))))))) is different from false [2024-11-08 17:20:07,904 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_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4360))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4361) .cse11 v_ArrVal_4363)) (.cse9 (store .cse10 .cse11 v_ArrVal_4362))) (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~malloc58#1.base_19|)))) (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~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4370))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4370 (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4370 .cse5)))))))))))) (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_prenex_34 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4360 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4360))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4361) .cse24 v_ArrVal_4363)) (.cse18 (store .cse23 .cse24 v_ArrVal_4362))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse22 .cse19 (store (select .cse22 .cse19) .cse20 0))) (.cse17 (+ 40 v_prenex_35))) (or (< v_prenex_35 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse15 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse13 .cse16 (store (select .cse13 .cse16) .cse17 v_prenex_34)))) (select (select .cse14 (select (select (store .cse15 .cse16 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (not (= (store (let ((.cse21 (store .cse18 .cse19 (store v_ArrVal_4362 .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse17 (select v_prenex_36 .cse17)) v_prenex_36))))))))) (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4360))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4361) .cse36 v_ArrVal_4363)) (.cse26 (store .cse35 .cse36 v_ArrVal_4362))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse28 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse29 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse33 (store .cse34 .cse27 (store (select .cse34 .cse27) .cse28 0)))) (or (not (= v_ArrVal_4370 (store (let ((.cse25 (store .cse26 .cse27 (store v_ArrVal_4362 .cse28 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse25 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse29 (select v_ArrVal_4370 .cse29)))) (< (let ((.cse31 (store .cse26 .cse27 (store (select .cse26 .cse27) .cse28 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse32 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse30 (store .cse33 .cse32 (store (select .cse33 .cse32) .cse29 v_ArrVal_4369)))) (select (select .cse30 (select (select (store .cse31 .cse32 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-08 17:20:27,697 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_prenex_34 Int) (v_prenex_35 Int) (v_ArrVal_4358 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4360 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4358))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_4360))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4359) .cse13 v_ArrVal_4361) .cse12 v_ArrVal_4363)) (.cse6 (store .cse11 .cse12 v_ArrVal_4362))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (+ 40 v_prenex_35)) (.cse4 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0)))) (or (< 0 (+ (let ((.cse1 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse5 v_prenex_34)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1)) (not (= (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4362 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse5 (select v_prenex_36 .cse5)) v_prenex_36)) (< v_prenex_35 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4358))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse25 (store .cse28 .cse27 v_ArrVal_4360))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4359) .cse27 v_ArrVal_4361) .cse26 v_ArrVal_4363)) (.cse20 (store .cse25 .cse26 v_ArrVal_4362))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse19 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse18 (store .cse24 .cse21 (store (select .cse24 .cse21) .cse22 0)))) (or (< (let ((.cse16 (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse15 (store .cse18 .cse17 (store (select .cse18 .cse17) .cse19 v_ArrVal_4369)))) (select (select .cse15 (select (select (store .cse16 .cse17 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1) (not (= v_ArrVal_4370 (store (let ((.cse23 (store .cse20 .cse21 (store v_ArrVal_4362 .cse22 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse19 (select v_ArrVal_4370 .cse19)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4358))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse38 (store .cse41 .cse40 v_ArrVal_4360))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse34 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4359) .cse40 v_ArrVal_4361) .cse39 v_ArrVal_4363)) (.cse37 (store .cse38 .cse39 v_ArrVal_4362))) (let ((.cse35 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse36 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse29 (store .cse37 .cse35 (store (select .cse37 .cse35) .cse36 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse31 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse33 (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 0)))) (or (not (= (store (select .cse29 .cse30) .cse31 (select v_ArrVal_4370 .cse31)) v_ArrVal_4370)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse32 (store .cse29 .cse30 v_ArrVal_4370))) (select .cse32 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse33 .cse30 (store (select .cse33 .cse30) .cse31 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-08 17:20:28,224 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_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4358))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse15 .cse14 v_ArrVal_4360))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4359) .cse14 v_ArrVal_4361) .cse12 v_ArrVal_4363)) (.cse2 (store .cse11 .cse12 v_ArrVal_4362))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0))) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4370 (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4362 .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4370 .cse5)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse8 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse6 .cse9 (store (select .cse6 .cse9) .cse5 v_ArrVal_4369)))) (select (select .cse7 (select (select (store .cse8 .cse9 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)))))))))) (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4358))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse28 .cse27 v_ArrVal_4360))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4359) .cse27 v_ArrVal_4361) .cse26 v_ArrVal_4363)) (.cse24 (store .cse25 .cse26 v_ArrVal_4362))) (let ((.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse23 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse24 .cse22 (store (select .cse24 .cse22) .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse19 (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 0))) (.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= (store (select .cse16 .cse17) .cse18 (select v_ArrVal_4370 .cse18)) v_ArrVal_4370)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse20 (store .cse16 .cse17 v_ArrVal_4370))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse19 .cse17 (store (select .cse19 .cse17) .cse18 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_prenex_34 Int) (v_prenex_35 Int) (v_ArrVal_4358 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4360 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4358))) (let ((.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse39 (store .cse42 .cse41 v_ArrVal_4360))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4359) .cse41 v_ArrVal_4361) .cse40 v_ArrVal_4363)) (.cse30 (store .cse39 .cse40 v_ArrVal_4362))) (let ((.cse31 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse32 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (+ 40 v_prenex_35)) (.cse37 (store .cse38 .cse31 (store (select .cse38 .cse31) .cse32 0)))) (or (not (= v_prenex_36 (store (let ((.cse29 (store .cse30 .cse31 (store v_ArrVal_4362 .cse32 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse33 (select v_prenex_36 .cse33)))) (< 0 (+ (let ((.cse35 (store .cse30 .cse31 (store (select .cse30 .cse31) .cse32 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store .cse37 .cse36 (store (select .cse37 .cse36) .cse33 v_prenex_34)))) (select (select .cse34 (select (select (store .cse35 .cse36 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (< v_prenex_35 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) is different from false [2024-11-08 17:20:29,091 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4357))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_4358))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_4360))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4356) .cse12 v_ArrVal_4359) .cse13 v_ArrVal_4361) .cse11 v_ArrVal_4363)) (.cse9 (store .cse10 .cse11 v_ArrVal_4362))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse0 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse3 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4370 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4370 .cse2)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4370))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) (forall ((v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse31 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4357))) (let ((.cse28 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse30 (store .cse31 .cse28 v_ArrVal_4358))) (let ((.cse29 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse26 (store .cse30 .cse29 v_ArrVal_4360))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse25 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4356) .cse28 v_ArrVal_4359) .cse29 v_ArrVal_4361) .cse27 v_ArrVal_4363)) (.cse21 (store .cse26 .cse27 v_ArrVal_4362))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse23 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse19 (store .cse25 .cse22 (store (select .cse25 .cse22) .cse23 0))) (.cse20 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< (let ((.cse17 (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse16 (store .cse19 .cse18 (store (select .cse19 .cse18) .cse20 v_ArrVal_4369)))) (select (select .cse16 (select (select (store .cse17 .cse18 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (not (= (store (let ((.cse24 (store .cse21 .cse22 (store v_ArrVal_4362 .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) .cse20 (select v_ArrVal_4370 .cse20)) v_ArrVal_4370))))))))))))) (forall ((v_prenex_34 Int) (v_prenex_35 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_4359 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4357))) (let ((.cse44 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse46 (store .cse47 .cse44 v_ArrVal_4358))) (let ((.cse45 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse42 (store .cse46 .cse45 v_ArrVal_4360))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse41 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4356) .cse44 v_ArrVal_4359) .cse45 v_ArrVal_4361) .cse43 v_ArrVal_4363)) (.cse33 (store .cse42 .cse43 v_ArrVal_4362))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse35 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse37 (store .cse41 .cse34 (store (select .cse41 .cse34) .cse35 0))) (.cse36 (+ 40 v_prenex_35))) (or (not (= v_prenex_36 (store (let ((.cse32 (store .cse33 .cse34 (store v_ArrVal_4362 .cse35 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse32 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) .cse36 (select v_prenex_36 .cse36)))) (< v_prenex_35 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (< 0 (+ (let ((.cse39 (store .cse33 .cse34 (store (select .cse33 .cse34) .cse35 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse38 (store .cse37 .cse40 (store (select .cse37 .cse40) .cse36 v_prenex_34)))) (select (select .cse38 (select (select (store .cse39 .cse40 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) 1))))))))))))))) is different from false [2024-11-08 17:20:29,605 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_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4357))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_4358))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse15 .cse14 v_ArrVal_4360))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4356) .cse13 v_ArrVal_4359) .cse14 v_ArrVal_4361) .cse11 v_ArrVal_4363)) (.cse9 (store .cse10 .cse11 v_ArrVal_4362))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse4 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0)))) (or (= (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4370))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 (store (select .cse4 .cse3) .cse5 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc58#1.base_19|) (not (= (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4370 .cse5)) v_ArrVal_4370)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) (forall ((v_prenex_34 Int) (v_prenex_35 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_4359 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4357))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_4358))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_4360))) (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_4356) .cse29 v_ArrVal_4359) .cse30 v_ArrVal_4361) .cse28 v_ArrVal_4363)) (.cse18 (store .cse27 .cse28 v_ArrVal_4362))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store .cse26 .cse19 (store (select .cse26 .cse19) .cse20 0))) (.cse21 (+ 40 v_prenex_35))) (or (not (= (store (let ((.cse17 (store .cse18 .cse19 (store v_ArrVal_4362 .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse21 (select v_prenex_36 .cse21)) v_prenex_36)) (< v_prenex_35 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse24 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store .cse22 .cse25 (store (select .cse22 .cse25) .cse21 v_prenex_34)))) (select (select .cse23 (select (select (store .cse24 .cse25 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1))))))))))))) (forall ((v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse48 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4357))) (let ((.cse45 (select (select .cse48 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse47 (store .cse48 .cse45 v_ArrVal_4358))) (let ((.cse46 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse43 (store .cse47 .cse46 v_ArrVal_4360))) (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_4356) .cse45 v_ArrVal_4359) .cse46 v_ArrVal_4361) .cse44 v_ArrVal_4363)) (.cse34 (store .cse43 .cse44 v_ArrVal_4362))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse36 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store .cse42 .cse35 (store (select .cse42 .cse35) .cse36 0))) (.cse37 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= (store (let ((.cse33 (store .cse34 .cse35 (store v_ArrVal_4362 .cse36 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse37 (select v_ArrVal_4370 .cse37)) v_ArrVal_4370)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse40 (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse41 (select (select .cse40 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse39 (store .cse38 .cse41 (store (select .cse38 .cse41) .cse37 v_ArrVal_4369)))) (select (select .cse39 (select (select (store .cse40 .cse41 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1))))))))))))))) is different from false [2024-11-08 17:20:30,615 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4375 (Array Int Int)) (v_ArrVal_4376 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4375))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_4357))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_4358))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_4360))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4376) .cse13 v_ArrVal_4356) .cse14 v_ArrVal_4359) .cse15 v_ArrVal_4361) .cse12 v_ArrVal_4363)) (.cse6 (store .cse11 .cse12 v_ArrVal_4362))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse4 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0)))) (or (< (let ((.cse1 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse5 v_ArrVal_4369)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1) (not (= v_ArrVal_4370 (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4362 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse5 (select v_ArrVal_4370 .cse5)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))))) (forall ((v_prenex_34 Int) (v_prenex_35 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4375 (Array Int Int)) (v_ArrVal_4376 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_4359 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4375))) (let ((.cse31 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse35 (store .cse36 .cse31 v_ArrVal_4357))) (let ((.cse32 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse34 (store .cse35 .cse32 v_ArrVal_4358))) (let ((.cse33 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse29 (store .cse34 .cse33 v_ArrVal_4360))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse28 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4376) .cse31 v_ArrVal_4356) .cse32 v_ArrVal_4359) .cse33 v_ArrVal_4361) .cse30 v_ArrVal_4363)) (.cse21 (store .cse29 .cse30 v_ArrVal_4362))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse23 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse19 (store .cse28 .cse22 (store (select .cse28 .cse22) .cse23 0))) (.cse24 (+ 40 v_prenex_35))) (or (< v_prenex_35 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (let ((.cse20 (store .cse21 .cse22 (store v_ArrVal_4362 .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse24 (select v_prenex_36 .cse24)) v_prenex_36)) (< 0 (+ (let ((.cse26 (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse25 (store .cse19 .cse27 (store (select .cse19 .cse27) .cse24 v_prenex_34)))) (select (select .cse25 (select (select (store .cse26 .cse27 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1))))))))))))))) (forall ((v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4375 (Array Int Int)) (v_ArrVal_4376 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse53 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4375))) (let ((.cse48 (select (select .cse53 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse52 (store .cse53 .cse48 v_ArrVal_4357))) (let ((.cse49 (select (select .cse52 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse51 (store .cse52 .cse49 v_ArrVal_4358))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse46 (store .cse51 .cse50 v_ArrVal_4360))) (let ((.cse47 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse42 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4376) .cse48 v_ArrVal_4356) .cse49 v_ArrVal_4359) .cse50 v_ArrVal_4361) .cse47 v_ArrVal_4363)) (.cse45 (store .cse46 .cse47 v_ArrVal_4362))) (let ((.cse43 (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse44 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse37 (store .cse45 .cse43 (store (select .cse45 .cse43) .cse44 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse38 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse39 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse41 (store .cse42 .cse43 (store (select .cse42 .cse43) .cse44 0)))) (or (not (= v_ArrVal_4370 (store (select .cse37 .cse38) .cse39 (select v_ArrVal_4370 .cse39)))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse40 (store .cse37 .cse38 v_ArrVal_4370))) (select .cse40 (select (select .cse40 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse41 .cse38 (store (select .cse41 .cse38) .cse39 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))))))) is different from false [2024-11-08 17:20:30,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817348818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:20:30,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:20:30,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 37 [2024-11-08 17:20:30,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578275221] [2024-11-08 17:20:30,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:20:30,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-08 17:20:30,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:20:30,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-08 17:20:30,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1572, Unknown=14, NotChecked=1196, Total=2970 [2024-11-08 17:20:30,817 INFO L87 Difference]: Start difference. First operand 620 states and 701 transitions. Second operand has 38 states, 35 states have (on average 4.514285714285714) internal successors, (158), 37 states have internal predecessors, (158), 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:20:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:20:40,386 INFO L93 Difference]: Finished difference Result 636 states and 720 transitions. [2024-11-08 17:20:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 17:20:40,387 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 4.514285714285714) internal successors, (158), 37 states have internal predecessors, (158), 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 114 [2024-11-08 17:20:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:20:40,389 INFO L225 Difference]: With dead ends: 636 [2024-11-08 17:20:40,389 INFO L226 Difference]: Without dead ends: 636 [2024-11-08 17:20:40,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=354, Invalid=2990, Unknown=14, NotChecked=1612, Total=4970 [2024-11-08 17:20:40,391 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 516 mSDsluCounter, 4686 mSDsCounter, 0 mSdLazyCounter, 4656 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 5008 SdHoareTripleChecker+Invalid, 4686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4656 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:20:40,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 5008 Invalid, 4686 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 4656 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2024-11-08 17:20:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-08 17:20:40,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 590. [2024-11-08 17:20:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 435 states have (on average 1.5241379310344827) internal successors, (663), 584 states have internal predecessors, (663), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:20:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 669 transitions. [2024-11-08 17:20:40,402 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 669 transitions. Word has length 114 [2024-11-08 17:20:40,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:20:40,403 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 669 transitions. [2024-11-08 17:20:40,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 4.514285714285714) internal successors, (158), 37 states have internal predecessors, (158), 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:20:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 669 transitions. [2024-11-08 17:20:40,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:20:40,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:20:40,405 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, 1] [2024-11-08 17:20:40,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-08 17:20:40,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-11-08 17:20:40,606 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:20:40,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:20:40,606 INFO L85 PathProgramCache]: Analyzing trace with hash -365353752, now seen corresponding path program 1 times [2024-11-08 17:20:40,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:20:40,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314583041] [2024-11-08 17:20:40,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:20:40,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:20:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:20:40,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:20:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:20:40,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 17:20:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:20:40,736 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:20:40,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:20:40,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314583041] [2024-11-08 17:20:40,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314583041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:20:40,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:20:40,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:20:40,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773616011] [2024-11-08 17:20:40,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:20:40,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:20:40,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:20:40,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:20:40,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:20:40,738 INFO L87 Difference]: Start difference. First operand 590 states and 669 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 17:20:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:20:41,866 INFO L93 Difference]: Finished difference Result 700 states and 816 transitions. [2024-11-08 17:20:41,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:20:41,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 123 [2024-11-08 17:20:41,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:20:41,868 INFO L225 Difference]: With dead ends: 700 [2024-11-08 17:20:41,868 INFO L226 Difference]: Without dead ends: 700 [2024-11-08 17:20:41,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:20:41,869 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 899 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:20:41,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 1014 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:20:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-08 17:20:41,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 694. [2024-11-08 17:20:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 546 states have (on average 1.467032967032967) internal successors, (801), 688 states have internal predecessors, (801), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:20:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 807 transitions. [2024-11-08 17:20:41,880 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 807 transitions. Word has length 123 [2024-11-08 17:20:41,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:20:41,880 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 807 transitions. [2024-11-08 17:20:41,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 17:20:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 807 transitions. [2024-11-08 17:20:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:20:41,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:20:41,882 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, 1] [2024-11-08 17:20:41,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-08 17:20:41,882 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:20:41,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:20:41,882 INFO L85 PathProgramCache]: Analyzing trace with hash -365353751, now seen corresponding path program 1 times [2024-11-08 17:20:41,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:20:41,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659135730] [2024-11-08 17:20:41,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:20:41,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:20:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:20:42,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:20:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:20:42,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 17:20:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:20:42,121 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:20:42,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:20:42,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659135730] [2024-11-08 17:20:42,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659135730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:20:42,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:20:42,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:20:42,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167373830] [2024-11-08 17:20:42,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:20:42,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:20:42,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:20:42,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:20:42,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:20:42,125 INFO L87 Difference]: Start difference. First operand 694 states and 807 transitions. Second operand has 6 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 17:20:43,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:20:43,915 INFO L93 Difference]: Finished difference Result 912 states and 1066 transitions. [2024-11-08 17:20:43,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:20:43,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 123 [2024-11-08 17:20:43,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:20:43,918 INFO L225 Difference]: With dead ends: 912 [2024-11-08 17:20:43,918 INFO L226 Difference]: Without dead ends: 912 [2024-11-08 17:20:43,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:20:43,919 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 848 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:20:43,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 1172 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 17:20:43,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2024-11-08 17:20:43,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 860. [2024-11-08 17:20:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 712 states have (on average 1.4634831460674158) internal successors, (1042), 854 states have internal predecessors, (1042), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:20:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1048 transitions. [2024-11-08 17:20:43,934 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1048 transitions. Word has length 123 [2024-11-08 17:20:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:20:43,935 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1048 transitions. [2024-11-08 17:20:43,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 17:20:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1048 transitions. [2024-11-08 17:20:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 17:20:43,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:20:43,936 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, 1, 1] [2024-11-08 17:20:43,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-08 17:20:43,936 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:20:43,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:20:43,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1558936326, now seen corresponding path program 1 times [2024-11-08 17:20:43,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:20:43,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690146173] [2024-11-08 17:20:43,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:20:43,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:20:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:20:44,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:20:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:20:44,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 17:20:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:20:44,324 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:20:44,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:20:44,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690146173] [2024-11-08 17:20:44,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690146173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:20:44,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253736186] [2024-11-08 17:20:44,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:20:44,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:20:44,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:20:44,328 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:20:44,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-08 17:20:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:20:44,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-08 17:20:44,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:20:45,459 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:20:45,460 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:20:45,506 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:20:45,511 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:20:45,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-08 17:20:45,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:20:45,776 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 48 treesize of output 32 [2024-11-08 17:20:45,924 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:20:45,925 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:20:46,021 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:20:46,021 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:20:46,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:20:46,124 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:20:46,240 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:20:46,240 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:20:46,448 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:20:46,449 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:20:46,544 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:20:46,812 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:20:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:20:46,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:20:47,269 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4746 (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_4746) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-08 17:20:47,294 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-08 17:20:47,294 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:20:47,306 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4745 (Array Int Int)) (v_ArrVal_4746 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem57#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4745))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4746)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-08 17:20:47,573 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4744 (Array Int Int)) (v_ArrVal_4745 (Array Int Int)) (v_ArrVal_4746 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4744)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_4745))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4746)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-08 17:20:47,602 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4744 (Array Int Int)) (v_ArrVal_4745 (Array Int Int)) (v_ArrVal_4746 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4744))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4745))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4746)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 17:20:47,661 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4743 (Array Int Int)) (v_ArrVal_4744 (Array Int Int)) (v_ArrVal_4745 (Array Int Int)) (v_ArrVal_4746 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4743))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4744)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4745))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4746)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 17:20:47,713 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4743 (Array Int Int)) (v_ArrVal_4744 (Array Int Int)) (v_ArrVal_4745 (Array Int Int)) (v_ArrVal_4746 (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_4743))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4744)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4745))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4746)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 17:20:47,838 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4742 (Array Int Int)) (v_ArrVal_4743 (Array Int Int)) (v_ArrVal_4744 (Array Int Int)) (v_ArrVal_4745 (Array Int Int)) (v_ArrVal_4746 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4742))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4743)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4744)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4745))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4746)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 17:20:47,931 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4742 (Array Int Int)) (v_ArrVal_4743 (Array Int Int)) (v_ArrVal_4744 (Array Int Int)) (v_ArrVal_4745 (Array Int Int)) (v_ArrVal_4746 (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_4742))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4743)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4744)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4745))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4746)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 17:20:48,322 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4742 (Array Int Int)) (v_ArrVal_4743 (Array Int Int)) (v_ArrVal_4744 (Array Int Int)) (v_ArrVal_4745 (Array Int Int)) (v_ArrVal_4740 Int) (v_ArrVal_4746 (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| |c_ULTIMATE.start_main_#t~mem53#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base|) (+ 16 |c_ULTIMATE.start_main_#t~mem53#1.offset|) v_ArrVal_4740)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4742)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4743)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4744)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_4745))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4746)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-08 17:20:55,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253736186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:20:55,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:20:55,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 18] total 22 [2024-11-08 17:20:55,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834758285] [2024-11-08 17:20:55,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:20:55,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 17:20:55,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:20:55,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 17:20:55,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=642, Unknown=32, NotChecked=540, Total=1332 [2024-11-08 17:20:55,554 INFO L87 Difference]: Start difference. First operand 860 states and 1048 transitions. Second operand has 22 states, 22 states have (on average 10.727272727272727) internal successors, (236), 21 states have internal predecessors, (236), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 17:21:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:21:03,227 INFO L93 Difference]: Finished difference Result 865 states and 1053 transitions. [2024-11-08 17:21:03,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:21:03,230 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.727272727272727) internal successors, (236), 21 states have internal predecessors, (236), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 124 [2024-11-08 17:21:03,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:21:03,232 INFO L225 Difference]: With dead ends: 865 [2024-11-08 17:21:03,232 INFO L226 Difference]: Without dead ends: 863 [2024-11-08 17:21:03,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=36, NotChecked=666, Total=1892 [2024-11-08 17:21:03,233 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 886 mSDsluCounter, 5537 mSDsCounter, 0 mSdLazyCounter, 4178 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 5862 SdHoareTripleChecker+Invalid, 4196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:21:03,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 5862 Invalid, 4196 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 4178 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-08 17:21:03,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-08 17:21:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2024-11-08 17:21:03,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 715 states have (on average 1.46013986013986) internal successors, (1044), 857 states have internal predecessors, (1044), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:21:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1051 transitions. [2024-11-08 17:21:03,247 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1051 transitions. Word has length 124 [2024-11-08 17:21:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:21:03,248 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1051 transitions. [2024-11-08 17:21:03,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.727272727272727) internal successors, (236), 21 states have internal predecessors, (236), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 17:21:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1051 transitions. [2024-11-08 17:21:03,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 17:21:03,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:21:03,249 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:21:03,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-08 17:21:03,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-11-08 17:21:03,450 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:21:03,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:03,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1039527440, now seen corresponding path program 1 times [2024-11-08 17:21:03,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:03,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634024432] [2024-11-08 17:21:03,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:03,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:03,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:21:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:03,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:21:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 17:21:03,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:03,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634024432] [2024-11-08 17:21:03,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634024432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:21:03,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990259127] [2024-11-08 17:21:03,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:03,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:21:03,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:21:03,885 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:21:03,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-08 17:21:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:04,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-08 17:21:04,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:21:04,410 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:21:05,322 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 17:21:05,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-08 17:21:05,359 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:21:05,359 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:21:05,417 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:21:05,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-08 17:21:05,875 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:21:05,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 31 treesize of output 32 [2024-11-08 17:21:06,105 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:21:06,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 17:21:06,266 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:21:06,267 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:21:06,415 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:21:06,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 17:21:06,555 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:21:06,556 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:21:06,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:21:06,705 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:21:06,730 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:21:06,731 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:21:06,850 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:21:06,850 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:21:07,115 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:21:07,115 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:21:07,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-08 17:21:07,493 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:21:07,853 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|#Ultimate.C_memset#1_#ptr.base| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_78| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |#Ultimate.C_memset#1_#ptr.base| (store (select |c_old(#memory_$Pointer$#1.base)| |#Ultimate.C_memset#1_#ptr.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_78| |c_#Ultimate.C_memset#1_#ptr.offset|) 0))) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_78| 0) (<= (+ |c_#Ultimate.C_memset#1_#amount| |c_#Ultimate.C_memset#1_#ptr.offset|) (select |c_#length| |#Ultimate.C_memset#1_#ptr.base|)))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_20| Int) (v_arrayElimCell_241 Int)) (and (= (select |c_#valid| v_arrayElimCell_241) 1) (<= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_20|) 40) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_20| v_arrayElimCell_241))))) is different from true [2024-11-08 17:21:07,975 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-11-08 17:21:07,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 28 [2024-11-08 17:21:08,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:21:08,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2024-11-08 17:21:08,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:21:08,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 67 treesize of output 85 [2024-11-08 17:21:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-08 17:21:08,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:21:09,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990259127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:21:09,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:21:09,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 26] total 31 [2024-11-08 17:21:09,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493334279] [2024-11-08 17:21:09,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:21:09,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-08 17:21:09,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:09,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-08 17:21:09,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1010, Unknown=1, NotChecked=64, Total=1190 [2024-11-08 17:21:09,385 INFO L87 Difference]: Start difference. First operand 863 states and 1051 transitions. Second operand has 31 states, 30 states have (on average 8.0) internal successors, (240), 29 states have internal predecessors, (240), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 17:21:22,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:21:22,854 INFO L93 Difference]: Finished difference Result 877 states and 1066 transitions. [2024-11-08 17:21:22,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 17:21:22,855 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 8.0) internal successors, (240), 29 states have internal predecessors, (240), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 126 [2024-11-08 17:21:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:21:22,858 INFO L225 Difference]: With dead ends: 877 [2024-11-08 17:21:22,858 INFO L226 Difference]: Without dead ends: 871 [2024-11-08 17:21:22,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=269, Invalid=2596, Unknown=1, NotChecked=104, Total=2970 [2024-11-08 17:21:22,859 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 854 mSDsluCounter, 4463 mSDsCounter, 0 mSdLazyCounter, 5917 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 4715 SdHoareTripleChecker+Invalid, 6493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 546 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:21:22,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 4715 Invalid, 6493 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 5917 Invalid, 0 Unknown, 546 Unchecked, 11.7s Time] [2024-11-08 17:21:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-08 17:21:22,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2024-11-08 17:21:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 721 states have (on average 1.4576976421636616) internal successors, (1051), 862 states have internal predecessors, (1051), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:21:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1058 transitions. [2024-11-08 17:21:22,873 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1058 transitions. Word has length 126 [2024-11-08 17:21:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:21:22,874 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1058 transitions. [2024-11-08 17:21:22,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 8.0) internal successors, (240), 29 states have internal predecessors, (240), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 17:21:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1058 transitions. [2024-11-08 17:21:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 17:21:22,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:21:22,877 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:21:22,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-08 17:21:23,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2024-11-08 17:21:23,078 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:21:23,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:23,078 INFO L85 PathProgramCache]: Analyzing trace with hash -848437498, now seen corresponding path program 2 times [2024-11-08 17:21:23,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:23,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511725286] [2024-11-08 17:21:23,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:23,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:23,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:21:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:23,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 17:21:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 17:21:23,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:23,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511725286] [2024-11-08 17:21:23,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511725286] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:21:23,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113447825] [2024-11-08 17:21:23,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 17:21:23,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:21:23,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:21:23,594 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:21:23,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-08 17:21:24,046 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 17:21:24,047 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:21:24,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 17:21:24,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:21:24,083 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 11 treesize of output 7 [2024-11-08 17:21:24,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 17:21:25,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:21:25,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2024-11-08 17:21:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 17:21:25,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:21:25,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113447825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:21:25,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:21:25,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2024-11-08 17:21:25,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477608705] [2024-11-08 17:21:25,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:21:25,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:21:25,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:25,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:21:25,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:21:25,647 INFO L87 Difference]: Start difference. First operand 869 states and 1058 transitions. Second operand has 13 states, 13 states have (on average 9.0) internal successors, (117), 13 states have internal predecessors, (117), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 17:21:27,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:21:27,764 INFO L93 Difference]: Finished difference Result 1196 states and 1406 transitions. [2024-11-08 17:21:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:21:27,764 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 13 states have internal predecessors, (117), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 128 [2024-11-08 17:21:27,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:21:27,766 INFO L225 Difference]: With dead ends: 1196 [2024-11-08 17:21:27,767 INFO L226 Difference]: Without dead ends: 1196 [2024-11-08 17:21:27,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2024-11-08 17:21:27,767 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 572 mSDsluCounter, 2261 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:21:27,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 2762 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 17:21:27,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2024-11-08 17:21:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 869. [2024-11-08 17:21:27,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 721 states have (on average 1.4563106796116505) internal successors, (1050), 862 states have internal predecessors, (1050), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:21:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1057 transitions. [2024-11-08 17:21:27,781 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1057 transitions. Word has length 128 [2024-11-08 17:21:27,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:21:27,781 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1057 transitions. [2024-11-08 17:21:27,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 13 states have internal predecessors, (117), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 17:21:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1057 transitions. [2024-11-08 17:21:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 17:21:27,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:21:27,782 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:21:27,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-08 17:21:27,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2024-11-08 17:21:27,983 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:21:27,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:27,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1396463217, now seen corresponding path program 1 times [2024-11-08 17:21:27,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:27,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437418583] [2024-11-08 17:21:27,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:27,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:28,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:21:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:28,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 17:21:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 17:21:28,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:28,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437418583] [2024-11-08 17:21:28,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437418583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:21:28,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768358074] [2024-11-08 17:21:28,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:28,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:21:28,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:21:28,456 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:21:28,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-08 17:21:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:28,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-08 17:21:28,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:21:28,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 17:21:29,666 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 17:21:29,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-08 17:21:29,690 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:21:29,690 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:21:29,738 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:21:29,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-08 17:21:30,108 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:21:30,108 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:21:30,249 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:21:30,249 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:21:30,371 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:21:30,372 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:21:30,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:21:30,489 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:21:30,610 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:21:30,611 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:21:30,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:21:30,723 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:21:30,740 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:21:30,741 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:21:30,838 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:21:30,839 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:21:31,020 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:21:31,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 42 treesize of output 41 [2024-11-08 17:21:31,104 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:21:40,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:21:40,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-08 17:21:40,444 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-08 17:21:40,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 26 [2024-11-08 17:21:40,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 31 treesize of output 13 [2024-11-08 17:21:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:21:41,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:21:42,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768358074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:21:42,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:21:42,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 24] total 30 [2024-11-08 17:21:42,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274008177] [2024-11-08 17:21:42,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:21:42,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 17:21:42,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:42,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 17:21:42,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1008, Unknown=5, NotChecked=0, Total=1122 [2024-11-08 17:21:42,196 INFO L87 Difference]: Start difference. First operand 869 states and 1057 transitions. Second operand has 30 states, 29 states have (on average 8.448275862068966) internal successors, (245), 28 states have internal predecessors, (245), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 17:21:43,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:21:47,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:21:53,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:22:00,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:22:04,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:22:15,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:22:23,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-08 17:22:23,298 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-08 17:22:23,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=303, Invalid=2770, Unknown=7, NotChecked=0, Total=3080 [2024-11-08 17:22:23,300 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 180 mSDsluCounter, 2382 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 19 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 2513 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:23,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 2513 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1062 Invalid, 4 Unknown, 0 Unchecked, 27.8s Time] [2024-11-08 17:22:23,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-08 17:22:23,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2024-11-08 17:22:23,501 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-11-08 17:22:23,505 INFO L158 Benchmark]: Toolchain (without parser) took 398670.24ms. Allocated memory was 134.2MB in the beginning and 597.7MB in the end (delta: 463.5MB). Free memory was 101.3MB in the beginning and 463.2MB in the end (delta: -361.9MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. [2024-11-08 17:22:23,505 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 134.2MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:22:23,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1078.12ms. Allocated memory is still 134.2MB. Free memory was 101.3MB in the beginning and 70.5MB in the end (delta: 30.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 17:22:23,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.16ms. Allocated memory is still 134.2MB. Free memory was 70.1MB in the beginning and 64.5MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 17:22:23,505 INFO L158 Benchmark]: Boogie Preprocessor took 220.07ms. Allocated memory was 134.2MB in the beginning and 190.8MB in the end (delta: 56.6MB). Free memory was 64.5MB in the beginning and 158.4MB in the end (delta: -93.9MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-11-08 17:22:23,505 INFO L158 Benchmark]: RCFGBuilder took 2916.18ms. Allocated memory is still 190.8MB. Free memory was 158.4MB in the beginning and 97.4MB in the end (delta: 61.0MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. [2024-11-08 17:22:23,505 INFO L158 Benchmark]: TraceAbstraction took 394324.13ms. Allocated memory was 190.8MB in the beginning and 597.7MB in the end (delta: 406.8MB). Free memory was 96.4MB in the beginning and 463.2MB in the end (delta: -366.8MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-11-08 17:22:23,506 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 134.2MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1078.12ms. Allocated memory is still 134.2MB. Free memory was 101.3MB in the beginning and 70.5MB in the end (delta: 30.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.16ms. Allocated memory is still 134.2MB. Free memory was 70.1MB in the beginning and 64.5MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 220.07ms. Allocated memory was 134.2MB in the beginning and 190.8MB in the end (delta: 56.6MB). Free memory was 64.5MB in the beginning and 158.4MB in the end (delta: -93.9MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2916.18ms. Allocated memory is still 190.8MB. Free memory was 158.4MB in the beginning and 97.4MB in the end (delta: 61.0MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. * TraceAbstraction took 394324.13ms. Allocated memory was 190.8MB in the beginning and 597.7MB in the end (delta: 406.8MB). Free memory was 96.4MB in the beginning and 463.2MB in the end (delta: -366.8MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/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_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:22:25,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:22:25,823 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-08 17:22:25,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:22:25,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:22:25,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:22:25,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:22:25,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:22:25,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:22:25,876 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:22:25,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:22:25,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:22:25,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:22:25,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:22:25,880 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:22:25,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:22:25,881 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:22:25,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:22:25,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:22:25,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:22:25,882 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 17:22:25,887 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 17:22:25,887 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 17:22:25,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:22:25,888 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:22:25,888 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:22:25,888 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:22:25,888 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:22:25,889 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 17:22:25,889 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:22:25,889 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:22:25,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:22:25,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:22:25,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:22:25,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:22:25,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:22:25,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:22:25,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:22:25,894 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:22:25,894 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:22:25,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:22:25,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:22:25,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:22:25,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:22:25,904 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_1f890db4-2d55-49fd-9224-9bf16aef740a/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_1f890db4-2d55-49fd-9224-9bf16aef740a/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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-11-08 17:22:26,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:22:26,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:22:26,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:22:26,356 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:22:26,356 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:22:26,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i Unable to find full path for "g++" [2024-11-08 17:22:28,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:22:28,681 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:22:28,681 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i [2024-11-08 17:22:28,704 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/data/d1f772410/fcac978b10d349e6b3fe64d49ab45149/FLAG016c902f5 [2024-11-08 17:22:28,926 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/data/d1f772410/fcac978b10d349e6b3fe64d49ab45149 [2024-11-08 17:22:28,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:22:28,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:22:28,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:22:28,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:22:28,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:22:28,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:22:28" (1/1) ... [2024-11-08 17:22:28,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@822ab20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:28, skipping insertion in model container [2024-11-08 17:22:28,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:22:28" (1/1) ... [2024-11-08 17:22:29,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:22:29,529 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:22:29,589 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:22:29,597 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:22:29,608 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:22:29,622 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:22:29,649 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:22:29,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:22:29,667 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:22:29,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:22:29,883 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:22:29,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:29 WrapperNode [2024-11-08 17:22:29,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:22:29,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:22:29,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:22:29,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:22:29,894 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:22:29" (1/1) ... [2024-11-08 17:22:29,935 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:22:29" (1/1) ... [2024-11-08 17:22:30,006 INFO L138 Inliner]: procedures = 179, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 577 [2024-11-08 17:22:30,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:22:30,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:22:30,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:22:30,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:22:30,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:29" (1/1) ... [2024-11-08 17:22:30,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:29" (1/1) ... [2024-11-08 17:22:30,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:29" (1/1) ... [2024-11-08 17:22:30,093 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-08 17:22:30,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:29" (1/1) ... [2024-11-08 17:22:30,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:29" (1/1) ... [2024-11-08 17:22:30,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:29" (1/1) ... [2024-11-08 17:22:30,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:29" (1/1) ... [2024-11-08 17:22:30,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:29" (1/1) ... [2024-11-08 17:22:30,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:29" (1/1) ... [2024-11-08 17:22:30,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:22:30,160 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:22:30,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:22:30,161 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:22:30,162 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:29" (1/1) ... [2024-11-08 17:22:30,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:22:30,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:30,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/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:22:30,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/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:22:30,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 17:22:30,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 17:22:30,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 17:22:30,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 17:22:30,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-08 17:22:30,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-08 17:22:30,259 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-08 17:22:30,259 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-08 17:22:30,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 17:22:30,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:22:30,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 17:22:30,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 17:22:30,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 17:22:30,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 17:22:30,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 17:22:30,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 17:22:30,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 17:22:30,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:22:30,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:22:30,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:22:30,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:22:30,485 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:22:30,490 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:22:30,495 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 17:22:30,556 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 17:22:33,644 INFO L? ?]: Removed 678 outVars from TransFormulas that were not future-live. [2024-11-08 17:22:33,645 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:22:33,688 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:22:33,692 INFO L316 CfgBuilder]: Removed 27 assume(true) statements. [2024-11-08 17:22:33,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:22:33 BoogieIcfgContainer [2024-11-08 17:22:33,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:22:33,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:22:33,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:22:33,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:22:33,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:22:28" (1/3) ... [2024-11-08 17:22:33,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef65a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:22:33, skipping insertion in model container [2024-11-08 17:22:33,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:29" (2/3) ... [2024-11-08 17:22:33,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef65a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:22:33, skipping insertion in model container [2024-11-08 17:22:33,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:22:33" (3/3) ... [2024-11-08 17:22:33,709 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test1-1.i [2024-11-08 17:22:33,724 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:22:33,724 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-08 17:22:33,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:22:33,790 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;@3a48078b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:22:33,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-08 17:22:33,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 640 states, 318 states have (on average 2.1949685534591197) internal successors, (698), 635 states have internal predecessors, (698), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:22:33,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 17:22:33,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:33,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 17:22:33,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:33,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:33,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042701, now seen corresponding path program 1 times [2024-11-08 17:22:33,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:33,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1949825464] [2024-11-08 17:22:33,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:33,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:33,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:33,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:33,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:22:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:33,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:22:33,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:33,998 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:22:33,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:33,999 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:33,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949825464] [2024-11-08 17:22:34,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949825464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:34,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:34,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:22:34,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895768322] [2024-11-08 17:22:34,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:34,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:22:34,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:34,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:22:34,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:22:34,047 INFO L87 Difference]: Start difference. First operand has 640 states, 318 states have (on average 2.1949685534591197) internal successors, (698), 635 states have internal predecessors, (698), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:22:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:34,114 INFO L93 Difference]: Finished difference Result 630 states and 661 transitions. [2024-11-08 17:22:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:22:34,117 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 17:22:34,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:34,131 INFO L225 Difference]: With dead ends: 630 [2024-11-08 17:22:34,131 INFO L226 Difference]: Without dead ends: 628 [2024-11-08 17:22:34,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:22:34,136 INFO L432 NwaCegarLoop]: 661 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:34,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:22:34,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-08 17:22:34,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2024-11-08 17:22:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 312 states have (on average 2.092948717948718) internal successors, (653), 623 states have internal predecessors, (653), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:22:34,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 659 transitions. [2024-11-08 17:22:34,220 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 659 transitions. Word has length 6 [2024-11-08 17:22:34,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:34,221 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 659 transitions. [2024-11-08 17:22:34,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:22:34,221 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 659 transitions. [2024-11-08 17:22:34,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 17:22:34,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:34,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 17:22:34,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 17:22:34,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:34,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:34,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:34,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042763, now seen corresponding path program 1 times [2024-11-08 17:22:34,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:34,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838324598] [2024-11-08 17:22:34,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:34,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:34,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:34,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:34,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:22:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:34,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:22:34,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:34,620 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 7 [2024-11-08 17:22:34,644 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:22:34,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:34,645 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:34,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838324598] [2024-11-08 17:22:34,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838324598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:34,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:34,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:22:34,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392912681] [2024-11-08 17:22:34,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:34,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:22:34,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:34,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:22:34,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:22:34,649 INFO L87 Difference]: Start difference. First operand 628 states and 659 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:22:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:36,173 INFO L93 Difference]: Finished difference Result 582 states and 615 transitions. [2024-11-08 17:22:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:22:36,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 17:22:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:36,176 INFO L225 Difference]: With dead ends: 582 [2024-11-08 17:22:36,176 INFO L226 Difference]: Without dead ends: 582 [2024-11-08 17:22:36,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:22:36,178 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 522 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:36,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 316 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 17:22:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-08 17:22:36,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 579. [2024-11-08 17:22:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 312 states have (on average 1.935897435897436) internal successors, (604), 574 states have internal predecessors, (604), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:22:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 610 transitions. [2024-11-08 17:22:36,207 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 610 transitions. Word has length 6 [2024-11-08 17:22:36,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:36,207 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 610 transitions. [2024-11-08 17:22:36,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:22:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 610 transitions. [2024-11-08 17:22:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 17:22:36,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:36,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 17:22:36,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 17:22:36,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:36,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:36,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:36,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042764, now seen corresponding path program 1 times [2024-11-08 17:22:36,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:36,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [813839868] [2024-11-08 17:22:36,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:36,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:36,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:36,415 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:36,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:22:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:36,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:22:36,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:36,534 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:22:36,558 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:22:36,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:36,559 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:36,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813839868] [2024-11-08 17:22:36,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813839868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:36,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:36,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:22:36,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658149907] [2024-11-08 17:22:36,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:36,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:22:36,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:36,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:22:36,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:22:36,561 INFO L87 Difference]: Start difference. First operand 579 states and 610 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:22:38,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:38,232 INFO L93 Difference]: Finished difference Result 654 states and 690 transitions. [2024-11-08 17:22:38,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:22:38,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 17:22:38,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:38,236 INFO L225 Difference]: With dead ends: 654 [2024-11-08 17:22:38,237 INFO L226 Difference]: Without dead ends: 654 [2024-11-08 17:22:38,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:22:38,238 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 271 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:38,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 662 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 17:22:38,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-11-08 17:22:38,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 605. [2024-11-08 17:22:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 349 states have (on average 1.9111747851002865) internal successors, (667), 600 states have internal predecessors, (667), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:22:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 673 transitions. [2024-11-08 17:22:38,266 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 673 transitions. Word has length 6 [2024-11-08 17:22:38,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:38,266 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 673 transitions. [2024-11-08 17:22:38,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:22:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 673 transitions. [2024-11-08 17:22:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 17:22:38,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:38,268 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:38,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 17:22:38,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:38,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:38,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:38,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1969530631, now seen corresponding path program 1 times [2024-11-08 17:22:38,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:38,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210272633] [2024-11-08 17:22:38,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:38,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:38,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:38,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:38,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 17:22:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:38,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:22:38,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:38,654 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:22:38,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:38,657 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:38,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210272633] [2024-11-08 17:22:38,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210272633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:38,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:38,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:22:38,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366794635] [2024-11-08 17:22:38,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:38,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:22:38,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:38,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:22:38,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:22:38,660 INFO L87 Difference]: Start difference. First operand 605 states and 673 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:22:39,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:39,266 INFO L93 Difference]: Finished difference Result 739 states and 822 transitions. [2024-11-08 17:22:39,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:22:39,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:22:39,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:39,269 INFO L225 Difference]: With dead ends: 739 [2024-11-08 17:22:39,269 INFO L226 Difference]: Without dead ends: 739 [2024-11-08 17:22:39,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:22:39,271 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 145 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:39,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1653 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:22:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-08 17:22:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 693. [2024-11-08 17:22:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 437 states have (on average 1.8672768878718535) internal successors, (816), 688 states have internal predecessors, (816), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:22:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 822 transitions. [2024-11-08 17:22:39,304 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 822 transitions. Word has length 7 [2024-11-08 17:22:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:39,304 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 822 transitions. [2024-11-08 17:22:39,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:22:39,304 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 822 transitions. [2024-11-08 17:22:39,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 17:22:39,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:39,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:39,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 17:22:39,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:39,509 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr319ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:39,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:39,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1347377724, now seen corresponding path program 1 times [2024-11-08 17:22:39,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:39,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1079946602] [2024-11-08 17:22:39,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:39,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:39,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:39,513 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:39,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 17:22:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:39,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 17:22:39,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:39,628 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:22:39,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:39,628 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:39,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079946602] [2024-11-08 17:22:39,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079946602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:39,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:39,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:22:39,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035709689] [2024-11-08 17:22:39,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:39,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:22:39,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:39,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:22:39,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:22:39,630 INFO L87 Difference]: Start difference. First operand 693 states and 822 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:22:40,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:40,641 INFO L93 Difference]: Finished difference Result 700 states and 828 transitions. [2024-11-08 17:22:40,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:22:40,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-08 17:22:40,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:40,645 INFO L225 Difference]: With dead ends: 700 [2024-11-08 17:22:40,645 INFO L226 Difference]: Without dead ends: 698 [2024-11-08 17:22:40,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:22:40,646 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 5 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:40,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 929 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:22:40,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-08 17:22:40,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 695. [2024-11-08 17:22:40,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 439 states have (on average 1.8633257403189065) internal successors, (818), 690 states have internal predecessors, (818), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:22:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 824 transitions. [2024-11-08 17:22:40,662 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 824 transitions. Word has length 9 [2024-11-08 17:22:40,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:40,663 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 824 transitions. [2024-11-08 17:22:40,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:22:40,663 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 824 transitions. [2024-11-08 17:22:40,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 17:22:40,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:40,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:40,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 17:22:40,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:40,865 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr318ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:40,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:40,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1347388552, now seen corresponding path program 1 times [2024-11-08 17:22:40,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:40,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1047006197] [2024-11-08 17:22:40,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:40,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:40,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:40,869 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:40,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 17:22:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:40,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:22:40,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:41,001 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:22:41,001 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:41,001 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:41,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047006197] [2024-11-08 17:22:41,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047006197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:41,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:41,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:22:41,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082765810] [2024-11-08 17:22:41,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:41,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:22:41,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:41,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:22:41,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:22:41,003 INFO L87 Difference]: Start difference. First operand 695 states and 824 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:22:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:41,040 INFO L93 Difference]: Finished difference Result 695 states and 823 transitions. [2024-11-08 17:22:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:22:41,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-08 17:22:41,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:41,044 INFO L225 Difference]: With dead ends: 695 [2024-11-08 17:22:41,045 INFO L226 Difference]: Without dead ends: 691 [2024-11-08 17:22:41,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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:22:41,046 INFO L432 NwaCegarLoop]: 597 mSDtfsCounter, 9 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:41,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1786 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:22:41,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-11-08 17:22:41,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2024-11-08 17:22:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 435 states have (on average 1.8666666666666667) internal successors, (812), 686 states have internal predecessors, (812), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:22:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 818 transitions. [2024-11-08 17:22:41,080 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 818 transitions. Word has length 9 [2024-11-08 17:22:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:41,080 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 818 transitions. [2024-11-08 17:22:41,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:22:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 818 transitions. [2024-11-08 17:22:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 17:22:41,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:41,081 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:41,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 17:22:41,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:41,286 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:41,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:41,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2115082515, now seen corresponding path program 1 times [2024-11-08 17:22:41,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:41,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990436045] [2024-11-08 17:22:41,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:41,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:41,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:41,290 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:41,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 17:22:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:41,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:22:41,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:41,418 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 7 [2024-11-08 17:22:41,491 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:22:41,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:41,491 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:41,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990436045] [2024-11-08 17:22:41,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990436045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:41,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:41,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:22:41,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837734242] [2024-11-08 17:22:41,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:41,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:22:41,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:41,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:22:41,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:22:41,493 INFO L87 Difference]: Start difference. First operand 691 states and 818 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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:22:43,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:43,319 INFO L93 Difference]: Finished difference Result 676 states and 780 transitions. [2024-11-08 17:22:43,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:22:43,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-11-08 17:22:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:43,322 INFO L225 Difference]: With dead ends: 676 [2024-11-08 17:22:43,322 INFO L226 Difference]: Without dead ends: 676 [2024-11-08 17:22:43,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:22:43,323 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 570 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:43,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 495 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 17:22:43,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-11-08 17:22:43,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 668. [2024-11-08 17:22:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 435 states have (on average 1.760919540229885) internal successors, (766), 663 states have internal predecessors, (766), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:22:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 772 transitions. [2024-11-08 17:22:43,356 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 772 transitions. Word has length 17 [2024-11-08 17:22:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:43,358 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 772 transitions. [2024-11-08 17:22:43,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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:22:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 772 transitions. [2024-11-08 17:22:43,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 17:22:43,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:43,360 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:43,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 17:22:43,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:43,568 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:43,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:43,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2115082514, now seen corresponding path program 1 times [2024-11-08 17:22:43,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:43,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [254757453] [2024-11-08 17:22:43,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:43,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:43,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:43,570 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:43,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 17:22:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:43,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 17:22:43,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:43,698 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:22:43,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:43,699 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:43,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254757453] [2024-11-08 17:22:43,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254757453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:43,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:43,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:22:43,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819159140] [2024-11-08 17:22:43,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:43,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:22:43,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:43,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:22:43,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:22:43,703 INFO L87 Difference]: Start difference. First operand 668 states and 772 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:22:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:43,739 INFO L93 Difference]: Finished difference Result 618 states and 706 transitions. [2024-11-08 17:22:43,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:22:43,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2024-11-08 17:22:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:43,742 INFO L225 Difference]: With dead ends: 618 [2024-11-08 17:22:43,743 INFO L226 Difference]: Without dead ends: 618 [2024-11-08 17:22:43,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:22:43,745 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 61 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1009 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:22:43,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1009 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:22:43,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-08 17:22:43,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2024-11-08 17:22:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 397 states have (on average 1.7632241813602014) internal successors, (700), 613 states have internal predecessors, (700), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:22:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 706 transitions. [2024-11-08 17:22:43,761 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 706 transitions. Word has length 17 [2024-11-08 17:22:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:43,762 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 706 transitions. [2024-11-08 17:22:43,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:22:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 706 transitions. [2024-11-08 17:22:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 17:22:43,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:43,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:43,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 17:22:43,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:43,964 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:43,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:43,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1141265928, now seen corresponding path program 1 times [2024-11-08 17:22:43,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:43,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1898576783] [2024-11-08 17:22:43,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:43,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:43,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:43,967 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:43,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 17:22:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:44,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:22:44,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:44,115 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:22:44,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:44,115 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:44,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898576783] [2024-11-08 17:22:44,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898576783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:44,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:44,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:22:44,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352127729] [2024-11-08 17:22:44,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:44,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:22:44,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:44,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:22:44,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:22:44,117 INFO L87 Difference]: Start difference. First operand 618 states and 706 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:22:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:44,219 INFO L93 Difference]: Finished difference Result 595 states and 662 transitions. [2024-11-08 17:22:44,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:22:44,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-08 17:22:44,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:44,221 INFO L225 Difference]: With dead ends: 595 [2024-11-08 17:22:44,222 INFO L226 Difference]: Without dead ends: 595 [2024-11-08 17:22:44,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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:22:44,224 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 45 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:44,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1456 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:22:44,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-08 17:22:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2024-11-08 17:22:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 381 states have (on average 1.7217847769028871) internal successors, (656), 590 states have internal predecessors, (656), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:22:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 662 transitions. [2024-11-08 17:22:44,239 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 662 transitions. Word has length 18 [2024-11-08 17:22:44,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:44,240 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 662 transitions. [2024-11-08 17:22:44,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:22:44,240 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 662 transitions. [2024-11-08 17:22:44,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 17:22:44,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:44,241 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] [2024-11-08 17:22:44,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-08 17:22:44,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:44,442 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:44,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:44,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2023947366, now seen corresponding path program 1 times [2024-11-08 17:22:44,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:44,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1066653520] [2024-11-08 17:22:44,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:44,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:44,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:44,444 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:44,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 17:22:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:44,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:22:44,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:44,569 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:22:44,873 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:22:44,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:44,873 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:44,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066653520] [2024-11-08 17:22:44,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066653520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:44,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:44,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:22:44,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122328985] [2024-11-08 17:22:44,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:44,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:22:44,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:44,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:22:44,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:22:44,875 INFO L87 Difference]: Start difference. First operand 595 states and 662 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:22:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:46,803 INFO L93 Difference]: Finished difference Result 648 states and 679 transitions. [2024-11-08 17:22:46,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:22:46,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-08 17:22:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:46,806 INFO L225 Difference]: With dead ends: 648 [2024-11-08 17:22:46,806 INFO L226 Difference]: Without dead ends: 648 [2024-11-08 17:22:46,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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:22:46,807 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 198 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:46,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 968 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 17:22:46,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-08 17:22:46,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 591. [2024-11-08 17:22:46,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 381 states have (on average 1.7007874015748032) internal successors, (648), 586 states have internal predecessors, (648), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:22:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 654 transitions. [2024-11-08 17:22:46,820 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 654 transitions. Word has length 32 [2024-11-08 17:22:46,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:46,820 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 654 transitions. [2024-11-08 17:22:46,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:22:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 654 transitions. [2024-11-08 17:22:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 17:22:46,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:46,822 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] [2024-11-08 17:22:46,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 17:22:47,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:47,024 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:47,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:47,024 INFO L85 PathProgramCache]: Analyzing trace with hash -577675290, now seen corresponding path program 1 times [2024-11-08 17:22:47,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:47,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1203784499] [2024-11-08 17:22:47,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:47,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:47,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:47,027 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:47,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 17:22:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:22:47,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:47,273 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:22:47,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:47,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:47,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203784499] [2024-11-08 17:22:47,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203784499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:47,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:47,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:22:47,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904073784] [2024-11-08 17:22:47,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:47,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:22:47,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:47,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:22:47,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:22:47,276 INFO L87 Difference]: Start difference. First operand 591 states and 654 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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:22:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:47,353 INFO L93 Difference]: Finished difference Result 579 states and 634 transitions. [2024-11-08 17:22:47,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:22:47,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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 51 [2024-11-08 17:22:47,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:47,356 INFO L225 Difference]: With dead ends: 579 [2024-11-08 17:22:47,356 INFO L226 Difference]: Without dead ends: 579 [2024-11-08 17:22:47,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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:22:47,357 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 21 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:47,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1442 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:22:47,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-08 17:22:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2024-11-08 17:22:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 369 states have (on average 1.7018970189701896) internal successors, (628), 574 states have internal predecessors, (628), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:22:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 634 transitions. [2024-11-08 17:22:47,372 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 634 transitions. Word has length 51 [2024-11-08 17:22:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:47,372 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 634 transitions. [2024-11-08 17:22:47,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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:22:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 634 transitions. [2024-11-08 17:22:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-08 17:22:47,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:47,378 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] [2024-11-08 17:22:47,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 17:22:47,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:47,583 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:47,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:47,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1173253914, now seen corresponding path program 1 times [2024-11-08 17:22:47,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:47,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [571878579] [2024-11-08 17:22:47,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:47,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:47,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:47,585 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:47,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 17:22:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:22:47,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:47,808 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:22:48,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:22:48,572 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:22:48,597 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:22:48,597 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 13 treesize of output 13 [2024-11-08 17:22:48,606 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:22:48,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:48,606 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:48,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571878579] [2024-11-08 17:22:48,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571878579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:48,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:48,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:22:48,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257261374] [2024-11-08 17:22:48,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:48,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:22:48,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:48,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:22:48,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:22:48,608 INFO L87 Difference]: Start difference. First operand 579 states and 634 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:22:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:50,430 INFO L93 Difference]: Finished difference Result 541 states and 596 transitions. [2024-11-08 17:22:50,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:22:50,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-11-08 17:22:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:50,433 INFO L225 Difference]: With dead ends: 541 [2024-11-08 17:22:50,433 INFO L226 Difference]: Without dead ends: 541 [2024-11-08 17:22:50,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:22:50,434 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 417 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:50,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 313 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 17:22:50,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-08 17:22:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 504. [2024-11-08 17:22:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 332 states have (on average 1.5542168674698795) internal successors, (516), 499 states have internal predecessors, (516), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:22:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 522 transitions. [2024-11-08 17:22:50,444 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 522 transitions. Word has length 59 [2024-11-08 17:22:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:50,444 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 522 transitions. [2024-11-08 17:22:50,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:22:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 522 transitions. [2024-11-08 17:22:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 17:22:50,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:50,446 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] [2024-11-08 17:22:50,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-08 17:22:50,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:50,650 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:50,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:50,650 INFO L85 PathProgramCache]: Analyzing trace with hash -493315492, now seen corresponding path program 1 times [2024-11-08 17:22:50,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:50,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1700162398] [2024-11-08 17:22:50,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:50,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:50,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:50,652 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:50,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 17:22:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 17:22:50,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:50,858 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 7 [2024-11-08 17:22:50,882 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:22:50,918 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 23 treesize of output 11 [2024-11-08 17:22:50,934 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:22:50,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:50,935 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:50,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700162398] [2024-11-08 17:22:50,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700162398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:50,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:50,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:22:50,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973269360] [2024-11-08 17:22:50,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:50,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:22:50,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:50,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:22:50,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:22:50,938 INFO L87 Difference]: Start difference. First operand 504 states and 522 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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:22:52,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:52,839 INFO L93 Difference]: Finished difference Result 503 states and 521 transitions. [2024-11-08 17:22:52,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:22:52,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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 64 [2024-11-08 17:22:52,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:52,842 INFO L225 Difference]: With dead ends: 503 [2024-11-08 17:22:52,842 INFO L226 Difference]: Without dead ends: 503 [2024-11-08 17:22:52,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 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:22:52,843 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 2 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:52,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1168 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 17:22:52,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-08 17:22:52,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2024-11-08 17:22:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 332 states have (on average 1.5512048192771084) internal successors, (515), 498 states have internal predecessors, (515), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:22:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 521 transitions. [2024-11-08 17:22:52,853 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 521 transitions. Word has length 64 [2024-11-08 17:22:52,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:52,854 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 521 transitions. [2024-11-08 17:22:52,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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:22:52,854 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 521 transitions. [2024-11-08 17:22:52,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 17:22:52,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:52,855 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] [2024-11-08 17:22:52,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-08 17:22:53,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:53,056 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:53,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:53,057 INFO L85 PathProgramCache]: Analyzing trace with hash -493315491, now seen corresponding path program 1 times [2024-11-08 17:22:53,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:53,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [580359603] [2024-11-08 17:22:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:53,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:53,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:53,059 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:53,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 17:22:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:53,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 17:22:53,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:53,279 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:22:53,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 17:22:53,316 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:22:53,384 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 21 treesize of output 9 [2024-11-08 17:22:53,422 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:22:53,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:53,422 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:53,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580359603] [2024-11-08 17:22:53,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580359603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:53,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:53,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:22:53,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266982595] [2024-11-08 17:22:53,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:53,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:22:53,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:53,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:22:53,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:22:53,425 INFO L87 Difference]: Start difference. First operand 503 states and 521 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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:22:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:55,593 INFO L93 Difference]: Finished difference Result 502 states and 520 transitions. [2024-11-08 17:22:55,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:22:55,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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 64 [2024-11-08 17:22:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:55,596 INFO L225 Difference]: With dead ends: 502 [2024-11-08 17:22:55,596 INFO L226 Difference]: Without dead ends: 502 [2024-11-08 17:22:55,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:22:55,597 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 1 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:55,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1177 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 17:22:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-08 17:22:55,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2024-11-08 17:22:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 331 states have (on average 1.552870090634441) internal successors, (514), 497 states have internal predecessors, (514), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:22:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 520 transitions. [2024-11-08 17:22:55,608 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 520 transitions. Word has length 64 [2024-11-08 17:22:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:55,608 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 520 transitions. [2024-11-08 17:22:55,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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:22:55,608 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 520 transitions. [2024-11-08 17:22:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-08 17:22:55,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:55,609 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] [2024-11-08 17:22:55,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-08 17:22:55,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:55,810 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:55,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1301506173, now seen corresponding path program 1 times [2024-11-08 17:22:55,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:55,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137741598] [2024-11-08 17:22:55,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:55,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:55,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:55,812 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:55,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-08 17:22:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:56,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 17:22:56,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:56,025 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:22:56,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 17:22:56,134 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:22:56,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:56,135 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:56,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137741598] [2024-11-08 17:22:56,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137741598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:56,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:56,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:22:56,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630335160] [2024-11-08 17:22:56,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:56,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:22:56,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:56,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:22:56,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:22:56,138 INFO L87 Difference]: Start difference. First operand 502 states and 520 transitions. Second operand has 7 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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:22:58,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:58,619 INFO L93 Difference]: Finished difference Result 514 states and 535 transitions. [2024-11-08 17:22:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:22:58,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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 72 [2024-11-08 17:22:58,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:58,623 INFO L225 Difference]: With dead ends: 514 [2024-11-08 17:22:58,623 INFO L226 Difference]: Without dead ends: 514 [2024-11-08 17:22:58,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:22:58,624 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 6 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:58,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1849 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 17:22:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-08 17:22:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 508. [2024-11-08 17:22:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 336 states have (on average 1.5505952380952381) internal successors, (521), 502 states have internal predecessors, (521), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 17:22:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 530 transitions. [2024-11-08 17:22:58,636 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 530 transitions. Word has length 72 [2024-11-08 17:22:58,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:58,637 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 530 transitions. [2024-11-08 17:22:58,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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:22:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 530 transitions. [2024-11-08 17:22:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-08 17:22:58,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:58,638 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] [2024-11-08 17:22:58,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-08 17:22:58,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:58,841 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:58,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:58,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1301506172, now seen corresponding path program 1 times [2024-11-08 17:22:58,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:58,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905208727] [2024-11-08 17:22:58,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:58,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:58,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:58,844 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:58,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-08 17:22:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:22:59,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:59,076 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:22:59,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:59,076 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:59,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905208727] [2024-11-08 17:22:59,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905208727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:59,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:59,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:22:59,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442640892] [2024-11-08 17:22:59,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:59,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:22:59,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:59,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:22:59,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:22:59,079 INFO L87 Difference]: Start difference. First operand 508 states and 530 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:22:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:59,128 INFO L93 Difference]: Finished difference Result 505 states and 524 transitions. [2024-11-08 17:22:59,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:22:59,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 72 [2024-11-08 17:22:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:59,130 INFO L225 Difference]: With dead ends: 505 [2024-11-08 17:22:59,131 INFO L226 Difference]: Without dead ends: 505 [2024-11-08 17:22:59,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 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:22:59,131 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 0 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:59,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1387 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:22:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-08 17:22:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2024-11-08 17:22:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 333 states have (on average 1.5525525525525525) internal successors, (517), 500 states have internal predecessors, (517), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:22:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 524 transitions. [2024-11-08 17:22:59,142 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 524 transitions. Word has length 72 [2024-11-08 17:22:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:59,143 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 524 transitions. [2024-11-08 17:22:59,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:22:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 524 transitions. [2024-11-08 17:22:59,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-08 17:22:59,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:59,144 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] [2024-11-08 17:22:59,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-08 17:22:59,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:59,345 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:22:59,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash -47137158, now seen corresponding path program 1 times [2024-11-08 17:22:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:59,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1265727525] [2024-11-08 17:22:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:59,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:22:59,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:59,348 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:22:59,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-08 17:22:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:22:59,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:22:59,608 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:22:59,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:22:59,726 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:22:59,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:22:59,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265727525] [2024-11-08 17:22:59,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265727525] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:22:59,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:22:59,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-08 17:22:59,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387965733] [2024-11-08 17:22:59,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:22:59,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:22:59,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:59,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:22:59,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:22:59,733 INFO L87 Difference]: Start difference. First operand 505 states and 524 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 17:22:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:59,975 INFO L93 Difference]: Finished difference Result 517 states and 541 transitions. [2024-11-08 17:22:59,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:22:59,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 73 [2024-11-08 17:22:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:59,978 INFO L225 Difference]: With dead ends: 517 [2024-11-08 17:22:59,978 INFO L226 Difference]: Without dead ends: 517 [2024-11-08 17:22:59,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:22:59,979 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 7 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:59,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1389 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:22:59,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-08 17:22:59,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 515. [2024-11-08 17:22:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 342 states have (on average 1.5555555555555556) internal successors, (532), 509 states have internal predecessors, (532), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:22:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 539 transitions. [2024-11-08 17:22:59,993 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 539 transitions. Word has length 73 [2024-11-08 17:22:59,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:59,994 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 539 transitions. [2024-11-08 17:22:59,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 17:22:59,994 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 539 transitions. [2024-11-08 17:22:59,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 17:22:59,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:59,996 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:00,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-08 17:23:00,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:23:00,198 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:23:00,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:00,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1438260547, now seen corresponding path program 2 times [2024-11-08 17:23:00,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:23:00,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [605647889] [2024-11-08 17:23:00,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 17:23:00,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:23:00,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:23:00,201 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:23:00,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-08 17:23:08,695 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 17:23:08,695 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:23:08,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 17:23:08,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:23:08,866 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:23:08,866 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 13 treesize of output 13 [2024-11-08 17:23:08,892 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:23:09,132 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:23:09,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-08 17:23:09,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-08 17:23:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 17:23:09,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:23:09,312 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-08 17:23:09,312 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 25 treesize of output 24 [2024-11-08 17:23:09,325 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_523) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2024-11-08 17:23:09,328 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:23:09,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605647889] [2024-11-08 17:23:09,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605647889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:23:09,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [778091085] [2024-11-08 17:23:09,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 17:23:09,328 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:23:09,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:23:09,332 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:23:09,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-08 17:23:10,076 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 17:23:10,077 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:23:10,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 17:23:10,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:23:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:23:10,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:23:10,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:23:10,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [778091085] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:23:10,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:23:10,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2024-11-08 17:23:10,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193471087] [2024-11-08 17:23:10,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:23:10,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 17:23:10,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:23:10,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 17:23:10,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650 [2024-11-08 17:23:10,658 INFO L87 Difference]: Start difference. First operand 515 states and 539 transitions. Second operand has 24 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 17:23:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:20,113 INFO L93 Difference]: Finished difference Result 531 states and 562 transitions. [2024-11-08 17:23:20,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 17:23:20,114 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 76 [2024-11-08 17:23:20,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:20,116 INFO L225 Difference]: With dead ends: 531 [2024-11-08 17:23:20,116 INFO L226 Difference]: Without dead ends: 527 [2024-11-08 17:23:20,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=413, Invalid=2242, Unknown=1, NotChecked=100, Total=2756 [2024-11-08 17:23:20,118 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 429 mSDsluCounter, 3495 mSDsCounter, 0 mSdLazyCounter, 4003 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 3737 SdHoareTripleChecker+Invalid, 4023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:20,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 3737 Invalid, 4023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4003 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-11-08 17:23:20,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-08 17:23:20,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 523. [2024-11-08 17:23:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 351 states have (on average 1.547008547008547) internal successors, (543), 517 states have internal predecessors, (543), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:23:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 550 transitions. [2024-11-08 17:23:20,129 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 550 transitions. Word has length 76 [2024-11-08 17:23:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:20,129 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 550 transitions. [2024-11-08 17:23:20,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 17:23:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 550 transitions. [2024-11-08 17:23:20,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 17:23:20,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:20,131 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:20,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-08 17:23:20,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2024-11-08 17:23:20,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 17:23:20,532 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:23:20,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:20,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1879653916, now seen corresponding path program 1 times [2024-11-08 17:23:20,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:23:20,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [4817705] [2024-11-08 17:23:20,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:20,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:23:20,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:23:20,534 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:23:20,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-08 17:23:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 17:23:20,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:23:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:23:20,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:23:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:23:21,705 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:23:21,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4817705] [2024-11-08 17:23:21,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4817705] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:23:21,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:23:21,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-08 17:23:21,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7334795] [2024-11-08 17:23:21,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:23:21,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 17:23:21,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:23:21,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 17:23:21,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-08 17:23:21,708 INFO L87 Difference]: Start difference. First operand 523 states and 550 transitions. Second operand has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 17:23:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:24,859 INFO L93 Difference]: Finished difference Result 547 states and 589 transitions. [2024-11-08 17:23:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-08 17:23:24,860 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2024-11-08 17:23:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:24,863 INFO L225 Difference]: With dead ends: 547 [2024-11-08 17:23:24,864 INFO L226 Difference]: Without dead ends: 541 [2024-11-08 17:23:24,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 17:23:24,865 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 18 mSDsluCounter, 6446 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 6910 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:24,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 6910 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 17:23:24,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-08 17:23:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2024-11-08 17:23:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 369 states have (on average 1.5338753387533874) internal successors, (566), 535 states have internal predecessors, (566), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:23:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 573 transitions. [2024-11-08 17:23:24,878 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 573 transitions. Word has length 82 [2024-11-08 17:23:24,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:24,879 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 573 transitions. [2024-11-08 17:23:24,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 17:23:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 573 transitions. [2024-11-08 17:23:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:23:24,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:24,880 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:24,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-08 17:23:25,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:23:25,081 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:23:25,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:25,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2102928164, now seen corresponding path program 2 times [2024-11-08 17:23:25,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:23:25,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120250562] [2024-11-08 17:23:25,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 17:23:25,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:23:25,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:23:25,085 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:23:25,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-08 17:23:29,434 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 17:23:29,434 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:23:29,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-08 17:23:29,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:23:29,578 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:23:29,593 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:23:29,593 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 13 treesize of output 13 [2024-11-08 17:23:29,629 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:23:29,638 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:23:29,749 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:23:29,757 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:23:30,340 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:23:30,340 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:23:30,352 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:23:30,397 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:23:30,408 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:23:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-08 17:23:30,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:23:31,018 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_990 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_990 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_991) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:23:31,024 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:23:31,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120250562] [2024-11-08 17:23:31,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120250562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:23:31,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [332176700] [2024-11-08 17:23:31,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 17:23:31,024 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:23:31,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:23:31,025 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:23:31,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-08 17:23:31,862 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 17:23:31,862 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:23:31,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 17:23:31,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:23:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:23:33,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:23:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:23:35,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [332176700] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:23:35,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:23:35,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 26] total 58 [2024-11-08 17:23:35,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089448021] [2024-11-08 17:23:35,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:23:35,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-08 17:23:35,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:23:35,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-08 17:23:35,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2024-11-08 17:23:35,647 INFO L87 Difference]: Start difference. First operand 541 states and 573 transitions. Second operand has 58 states, 57 states have (on average 3.087719298245614) internal successors, (176), 58 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 17:24:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:13,018 INFO L93 Difference]: Finished difference Result 584 states and 646 transitions. [2024-11-08 17:24:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-11-08 17:24:13,019 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.087719298245614) internal successors, (176), 58 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 94 [2024-11-08 17:24:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:13,022 INFO L225 Difference]: With dead ends: 584 [2024-11-08 17:24:13,022 INFO L226 Difference]: Without dead ends: 576 [2024-11-08 17:24:13,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=3106, Invalid=14987, Unknown=1, NotChecked=266, Total=18360 [2024-11-08 17:24:13,027 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 462 mSDsluCounter, 6314 mSDsCounter, 0 mSdLazyCounter, 9244 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 6556 SdHoareTripleChecker+Invalid, 9320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 9244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:13,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 6556 Invalid, 9320 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [76 Valid, 9244 Invalid, 0 Unknown, 0 Unchecked, 27.7s Time] [2024-11-08 17:24:13,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-11-08 17:24:13,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 574. [2024-11-08 17:24:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 403 states have (on average 1.5062034739454093) internal successors, (607), 568 states have internal predecessors, (607), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:24:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 614 transitions. [2024-11-08 17:24:13,040 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 614 transitions. Word has length 94 [2024-11-08 17:24:13,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:13,041 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 614 transitions. [2024-11-08 17:24:13,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.087719298245614) internal successors, (176), 58 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 17:24:13,042 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 614 transitions. [2024-11-08 17:24:13,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:24:13,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:13,043 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:13,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-11-08 17:24:13,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-08 17:24:13,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:24:13,444 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:24:13,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:13,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1594888065, now seen corresponding path program 1 times [2024-11-08 17:24:13,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:24:13,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177902892] [2024-11-08 17:24:13,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:13,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:24:13,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:24:13,447 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:24:13,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-08 17:24:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:13,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-08 17:24:13,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:24:14,023 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:24:14,023 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 13 treesize of output 13 [2024-11-08 17:24:14,043 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:24:14,799 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:24:14,800 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 44 treesize of output 43 [2024-11-08 17:24:14,930 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:24:14,930 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 44 treesize of output 43 [2024-11-08 17:24:14,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-08 17:24:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:24:14,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:24:15,100 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_1544) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 17:24:15,663 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-08 17:24:15,663 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 37 treesize of output 36 [2024-11-08 17:24:15,675 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1590 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1590))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1544)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-08 17:24:15,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:24:15,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177902892] [2024-11-08 17:24:15,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177902892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:24:15,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1841126330] [2024-11-08 17:24:15,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:15,678 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:24:15,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:24:15,680 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:24:15,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-08 17:24:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:18,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-08 17:24:18,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:24:18,491 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 17:24:18,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-08 17:24:18,944 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-08 17:24:18,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-08 17:24:19,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 17:24:19,265 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 34 treesize of output 16 [2024-11-08 17:24:21,302 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:24:21,302 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 54 treesize of output 51 [2024-11-08 17:24:21,634 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:24:21,634 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 54 treesize of output 51 [2024-11-08 17:24:21,693 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 43 treesize of output 19 [2024-11-08 17:24:21,789 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:24:21,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:24:22,372 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2007))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1544)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:24:22,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1841126330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:24:22,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:24:22,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 21 [2024-11-08 17:24:22,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320864558] [2024-11-08 17:24:22,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:24:22,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 17:24:22,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:24:22,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 17:24:22,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=458, Unknown=11, NotChecked=138, Total=702 [2024-11-08 17:24:22,378 INFO L87 Difference]: Start difference. First operand 574 states and 614 transitions. Second operand has 22 states, 19 states have (on average 7.894736842105263) internal successors, (150), 21 states have internal predecessors, (150), 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:24:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:33,415 INFO L93 Difference]: Finished difference Result 1041 states and 1119 transitions. [2024-11-08 17:24:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 17:24:33,416 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.894736842105263) internal successors, (150), 21 states have internal predecessors, (150), 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 119 [2024-11-08 17:24:33,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:33,421 INFO L225 Difference]: With dead ends: 1041 [2024-11-08 17:24:33,421 INFO L226 Difference]: Without dead ends: 1041 [2024-11-08 17:24:33,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=215, Invalid=1263, Unknown=16, NotChecked=228, Total=1722 [2024-11-08 17:24:33,423 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 769 mSDsluCounter, 3338 mSDsCounter, 0 mSdLazyCounter, 3779 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 3799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:33,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 3574 Invalid, 3799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3779 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2024-11-08 17:24:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2024-11-08 17:24:33,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 573. [2024-11-08 17:24:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 403 states have (on average 1.5037220843672456) internal successors, (606), 567 states have internal predecessors, (606), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:24:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 613 transitions. [2024-11-08 17:24:33,441 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 613 transitions. Word has length 119 [2024-11-08 17:24:33,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:33,442 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 613 transitions. [2024-11-08 17:24:33,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.894736842105263) internal successors, (150), 21 states have internal predecessors, (150), 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:24:33,442 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 613 transitions. [2024-11-08 17:24:33,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:24:33,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:33,444 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:33,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-08 17:24:33,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-11-08 17:24:33,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 17:24:33,846 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:24:33,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:33,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1594888066, now seen corresponding path program 1 times [2024-11-08 17:24:33,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:24:33,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991219600] [2024-11-08 17:24:33,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:33,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:24:33,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:24:33,850 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:24:33,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-08 17:24:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:34,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-08 17:24:34,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:24:34,604 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:24:34,631 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:24:34,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 13 treesize of output 13 [2024-11-08 17:24:34,677 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:24:34,685 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:24:34,898 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:24:34,907 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:24:36,049 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:24:36,049 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:24:36,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 17:24:36,211 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:24:36,212 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:24:36,222 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:24:36,259 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:24:36,268 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:24:36,305 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:24:36,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:24:36,501 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2422 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2422) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_2422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2423 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2422) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:24:36,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2422 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2422) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_2422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2423 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2422) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_2423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-08 17:24:38,366 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2515))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2514) .cse0 v_ArrVal_2422) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2514) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2422) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-08 17:24:38,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:24:38,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991219600] [2024-11-08 17:24:38,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991219600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:24:38,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1052969786] [2024-11-08 17:24:38,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:38,376 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:24:38,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:24:38,378 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:24:38,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2024-11-08 17:24:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:41,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-08 17:24:41,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:24:41,672 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 7 [2024-11-08 17:24:41,862 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:24:41,862 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 13 treesize of output 13 [2024-11-08 17:24:41,874 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 6 treesize of output 5 [2024-11-08 17:24:41,902 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:24:41,917 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:24:42,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 22 treesize of output 10 [2024-11-08 17:24:42,013 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:24:43,148 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:24:43,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 17:24:43,163 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:24:43,296 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:24:43,297 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:24:43,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 17:24:43,355 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:24:43,366 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:24:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:24:43,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:24:43,456 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2931 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_2931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2932 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2932) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:24:43,487 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2932 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2932) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2931 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-08 17:24:45,267 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3024 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2931 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3024) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_3024 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2932 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3023))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3024) .cse2 v_ArrVal_2931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2932) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-08 17:24:45,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1052969786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:24:45,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:24:45,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2024-11-08 17:24:45,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873111776] [2024-11-08 17:24:45,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:24:45,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:24:45,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:24:45,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:24:45,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=132, Unknown=6, NotChecked=162, Total=342 [2024-11-08 17:24:45,277 INFO L87 Difference]: Start difference. First operand 573 states and 613 transitions. Second operand has 11 states, 9 states have (on average 11.555555555555555) internal successors, (104), 11 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:24:52,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:52,483 INFO L93 Difference]: Finished difference Result 572 states and 612 transitions. [2024-11-08 17:24:52,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:24:52,484 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 11.555555555555555) internal successors, (104), 11 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 119 [2024-11-08 17:24:52,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:52,487 INFO L225 Difference]: With dead ends: 572 [2024-11-08 17:24:52,487 INFO L226 Difference]: Without dead ends: 572 [2024-11-08 17:24:52,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=283, Unknown=6, NotChecked=234, Total=600 [2024-11-08 17:24:52,488 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 385 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:52,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1357 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-11-08 17:24:52,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-08 17:24:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2024-11-08 17:24:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 403 states have (on average 1.501240694789082) internal successors, (605), 566 states have internal predecessors, (605), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:24:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 612 transitions. [2024-11-08 17:24:52,502 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 612 transitions. Word has length 119 [2024-11-08 17:24:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:52,502 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 612 transitions. [2024-11-08 17:24:52,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 11.555555555555555) internal successors, (104), 11 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:24:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 612 transitions. [2024-11-08 17:24:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:24:52,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:52,505 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:52,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-08 17:24:52,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2024-11-08 17:24:52,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 17:24:52,906 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:24:52,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:52,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1912557270, now seen corresponding path program 1 times [2024-11-08 17:24:52,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:24:52,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [227821591] [2024-11-08 17:24:52,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:52,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:24:52,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:24:52,909 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:24:52,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-08 17:24:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:53,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-08 17:24:53,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:24:53,722 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:24:53,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-08 17:24:53,750 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:24:54,473 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:24:54,473 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 44 treesize of output 43 [2024-11-08 17:24:54,656 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:24:54,656 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 44 treesize of output 43 [2024-11-08 17:24:54,751 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:24:54,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 44 treesize of output 43 [2024-11-08 17:24:54,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-08 17:24:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:24:54,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:24:54,924 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_3400) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 17:24:54,942 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3399))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3400)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:24:54,954 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_3399))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3400)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-08 17:24:55,521 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2024-11-08 17:24:55,522 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 61 treesize of output 60 [2024-11-08 17:24:55,534 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3446))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3399)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3400)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-08 17:24:55,537 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:24:55,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227821591] [2024-11-08 17:24:55,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227821591] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:24:55,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1649285366] [2024-11-08 17:24:55,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:55,538 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:24:55,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:24:55,539 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:24:55,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-08 17:25:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:00,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-08 17:25:00,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:25:00,567 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 17:25:00,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-08 17:25:00,985 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-08 17:25:00,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-08 17:25:01,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 17:25:01,411 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 34 treesize of output 16 [2024-11-08 17:25:03,094 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:03,095 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 54 treesize of output 51 [2024-11-08 17:25:03,357 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:03,357 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 54 treesize of output 51 [2024-11-08 17:25:03,556 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:03,557 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 54 treesize of output 51 [2024-11-08 17:25:03,606 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 43 treesize of output 19 [2024-11-08 17:25:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:25:03,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:25:03,801 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3823))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3400)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:25:03,813 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_3823))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3400)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:25:04,344 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3870 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3870))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3823)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3400)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:25:04,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1649285366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:25:04,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:25:04,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 23 [2024-11-08 17:25:04,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730584108] [2024-11-08 17:25:04,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:25:04,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 17:25:04,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:25:04,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 17:25:04,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=546, Unknown=14, NotChecked=378, Total=1056 [2024-11-08 17:25:04,350 INFO L87 Difference]: Start difference. First operand 572 states and 612 transitions. Second operand has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 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:25:14,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:25:14,332 INFO L93 Difference]: Finished difference Result 1037 states and 1115 transitions. [2024-11-08 17:25:14,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-08 17:25:14,333 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 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 122 [2024-11-08 17:25:14,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:25:14,337 INFO L225 Difference]: With dead ends: 1037 [2024-11-08 17:25:14,337 INFO L226 Difference]: Without dead ends: 1037 [2024-11-08 17:25:14,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=250, Invalid=1481, Unknown=19, NotChecked=602, Total=2352 [2024-11-08 17:25:14,338 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 1371 mSDsluCounter, 3082 mSDsCounter, 0 mSdLazyCounter, 3522 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 3553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:25:14,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 3317 Invalid, 3553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3522 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2024-11-08 17:25:14,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2024-11-08 17:25:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 571. [2024-11-08 17:25:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 403 states have (on average 1.498759305210918) internal successors, (604), 565 states have internal predecessors, (604), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:25:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 611 transitions. [2024-11-08 17:25:14,368 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 611 transitions. Word has length 122 [2024-11-08 17:25:14,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:25:14,369 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 611 transitions. [2024-11-08 17:25:14,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 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:25:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 611 transitions. [2024-11-08 17:25:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:25:14,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:25:14,371 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:14,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-08 17:25:14,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-11-08 17:25:14,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:25:14,772 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:25:14,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:25:14,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1912557269, now seen corresponding path program 1 times [2024-11-08 17:25:14,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:25:14,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [889248608] [2024-11-08 17:25:14,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:25:14,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:25:14,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:25:14,775 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:25:14,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-08 17:25:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-08 17:25:15,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:25:15,624 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:25:15,639 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:25:15,639 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 13 treesize of output 13 [2024-11-08 17:25:15,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 17:25:15,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 13 treesize of output 9 [2024-11-08 17:25:15,820 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:25:15,826 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:25:16,787 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:16,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 17:25:16,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 30 treesize of output 13 [2024-11-08 17:25:16,935 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:16,936 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:25:16,946 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:25:17,098 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:17,098 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:25:17,109 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:25:17,141 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:25:17,150 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:25:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:25:17,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:25:17,564 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-08 17:25:17,660 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4291))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4292) .cse0 v_ArrVal_4294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4292) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-08 17:25:17,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4292) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4291))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4292) .cse3 v_ArrVal_4294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-08 17:25:19,534 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4386 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4385 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4386))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4385) .cse1 v_ArrVal_4292) (select (select (store .cse2 .cse1 v_ArrVal_4291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_4294))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4386 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4385 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4386))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_4291))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4385) .cse4 v_ArrVal_4292) .cse5 v_ArrVal_4294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_4293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-08 17:25:19,546 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:25:19,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889248608] [2024-11-08 17:25:19,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889248608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:25:19,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [651118340] [2024-11-08 17:25:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:25:19,547 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:25:19,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:25:19,548 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:25:19,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-08 17:25:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:24,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-08 17:25:24,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:25:24,613 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 7 [2024-11-08 17:25:24,768 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:25:24,783 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:25:24,783 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 13 treesize of output 13 [2024-11-08 17:25:24,815 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:25:24,824 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:25:24,889 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:25:24,895 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:25:25,831 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:25,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 62 treesize of output 57 [2024-11-08 17:25:25,851 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:25:25,977 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:25,977 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:25:25,988 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:25:26,066 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:26,066 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:25:26,077 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:25:26,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 17:25:26,121 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:25:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:25:26,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:25:26,192 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2024-11-08 17:25:26,225 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-08 17:25:26,276 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4809) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4810) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4810))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4809) .cse2 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-08 17:25:26,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4809) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4810) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4810))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4809) .cse3 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-08 17:25:28,981 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4903))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4904) .cse1 v_ArrVal_4809) (select (select (store .cse2 .cse1 v_ArrVal_4810) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_4812))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4903))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_4810))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4904) .cse4 v_ArrVal_4809) .cse5 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_4811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-08 17:25:28,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [651118340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:25:28,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:25:29,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 11 [2024-11-08 17:25:29,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902475518] [2024-11-08 17:25:29,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:25:29,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:25:29,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:25:29,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:25:29,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=175, Unknown=16, NotChecked=306, Total=552 [2024-11-08 17:25:29,001 INFO L87 Difference]: Start difference. First operand 571 states and 611 transitions. Second operand has 12 states, 10 states have (on average 10.7) internal successors, (107), 12 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:25:39,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:25:39,543 INFO L93 Difference]: Finished difference Result 570 states and 610 transitions. [2024-11-08 17:25:39,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:25:39,544 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 10.7) internal successors, (107), 12 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 122 [2024-11-08 17:25:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:25:39,546 INFO L225 Difference]: With dead ends: 570 [2024-11-08 17:25:39,546 INFO L226 Difference]: Without dead ends: 570 [2024-11-08 17:25:39,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 237 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=98, Invalid=383, Unknown=17, NotChecked=432, Total=930 [2024-11-08 17:25:39,548 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 383 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:25:39,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1062 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2024-11-08 17:25:39,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-08 17:25:39,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2024-11-08 17:25:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 403 states have (on average 1.4962779156327544) internal successors, (603), 564 states have internal predecessors, (603), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:25:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 610 transitions. [2024-11-08 17:25:39,562 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 610 transitions. Word has length 122 [2024-11-08 17:25:39,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:25:39,563 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 610 transitions. [2024-11-08 17:25:39,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 10.7) internal successors, (107), 12 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:25:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 610 transitions. [2024-11-08 17:25:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:25:39,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:25:39,565 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:39,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2024-11-08 17:25:39,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-11-08 17:25:39,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:25:39,966 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:25:39,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:25:39,967 INFO L85 PathProgramCache]: Analyzing trace with hash 42819080, now seen corresponding path program 1 times [2024-11-08 17:25:39,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:25:39,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333917584] [2024-11-08 17:25:39,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:25:39,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:25:39,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:25:39,971 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:25:39,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-08 17:25:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:40,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-08 17:25:40,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:25:41,209 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:25:41,209 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 13 treesize of output 13 [2024-11-08 17:25:41,270 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:25:42,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:42,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 44 treesize of output 43 [2024-11-08 17:25:43,203 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:43,203 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 44 treesize of output 43 [2024-11-08 17:25:43,437 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:43,438 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 44 treesize of output 43 [2024-11-08 17:25:43,687 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:43,687 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 44 treesize of output 43 [2024-11-08 17:25:43,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-08 17:25:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:25:43,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:25:43,957 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_5287) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-08 17:25:43,980 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_5287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 17:25:44,016 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5286))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5287)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:25:44,040 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_5286))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5287)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-08 17:25:44,079 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5285))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5286)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5287)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:25:44,107 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5285))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5286)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5287)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:25:45,051 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2024-11-08 17:25:45,051 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 109 treesize of output 108 [2024-11-08 17:25:45,078 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5333))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5285)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5286)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5287)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2024-11-08 17:25:45,084 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:25:45,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333917584] [2024-11-08 17:25:45,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333917584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:25:45,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [144056922] [2024-11-08 17:25:45,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:25:45,085 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:25:45,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:25:45,087 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:25:45,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-08 17:25:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:51,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-08 17:25:51,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:25:51,531 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 17:25:51,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-08 17:25:52,743 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-08 17:25:52,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-08 17:25:52,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 17:25:53,586 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 34 treesize of output 16 [2024-11-08 17:25:57,361 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:57,361 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 54 treesize of output 51 [2024-11-08 17:25:57,903 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:57,904 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 54 treesize of output 51 [2024-11-08 17:25:58,255 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:58,255 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 54 treesize of output 51 [2024-11-08 17:25:58,644 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:25:58,645 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 54 treesize of output 51 [2024-11-08 17:25:58,746 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 43 treesize of output 19 [2024-11-08 17:25:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:25:58,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:25:58,980 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_5718) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-08 17:25:58,999 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_5718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 17:25:59,029 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5717))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5718)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:25:59,050 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_5717))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5718)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-08 17:25:59,084 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5716))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5717)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5718)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:25:59,108 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5716))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5717)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5718)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:25:59,866 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5764 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5764))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5716)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5717)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5718)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:25:59,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [144056922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:25:59,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:25:59,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 25 [2024-11-08 17:25:59,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367653928] [2024-11-08 17:25:59,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:25:59,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 17:25:59,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:25:59,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 17:25:59,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=601, Unknown=14, NotChecked=882, Total=1640 [2024-11-08 17:25:59,875 INFO L87 Difference]: Start difference. First operand 570 states and 610 transitions. Second operand has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 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:26:17,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:26:17,441 INFO L93 Difference]: Finished difference Result 1033 states and 1111 transitions. [2024-11-08 17:26:17,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 17:26:17,442 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 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 125 [2024-11-08 17:26:17,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:26:17,445 INFO L225 Difference]: With dead ends: 1033 [2024-11-08 17:26:17,445 INFO L226 Difference]: Without dead ends: 1033 [2024-11-08 17:26:17,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=286, Invalid=1648, Unknown=14, NotChecked=1358, Total=3306 [2024-11-08 17:26:17,447 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1058 mSDsluCounter, 3005 mSDsCounter, 0 mSdLazyCounter, 3438 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 3239 SdHoareTripleChecker+Invalid, 3463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:26:17,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 3239 Invalid, 3463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3438 Invalid, 0 Unknown, 0 Unchecked, 16.2s Time] [2024-11-08 17:26:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2024-11-08 17:26:17,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 569. [2024-11-08 17:26:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 403 states have (on average 1.4937965260545907) internal successors, (602), 563 states have internal predecessors, (602), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:26:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 609 transitions. [2024-11-08 17:26:17,462 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 609 transitions. Word has length 125 [2024-11-08 17:26:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:26:17,462 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 609 transitions. [2024-11-08 17:26:17,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 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:26:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 609 transitions. [2024-11-08 17:26:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:26:17,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:26:17,464 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:17,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2024-11-08 17:26:17,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-11-08 17:26:17,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:26:17,865 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:26:17,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:26:17,866 INFO L85 PathProgramCache]: Analyzing trace with hash 42819081, now seen corresponding path program 1 times [2024-11-08 17:26:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:26:17,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1445168240] [2024-11-08 17:26:17,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:26:17,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:26:17,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:26:17,868 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:26:17,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-08 17:26:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:26:18,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-08 17:26:18,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:26:18,987 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:26:19,025 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:26:19,025 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 13 treesize of output 13 [2024-11-08 17:26:19,095 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:26:19,104 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:26:19,379 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:26:19,389 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:26:21,068 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:26:21,068 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:26:21,091 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:26:21,355 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:26:21,356 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:26:21,373 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:26:21,607 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:26:21,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 62 treesize of output 57 [2024-11-08 17:26:21,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 17:26:21,876 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:26:21,877 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:26:21,903 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:26:21,956 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:26:21,974 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:26:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:26:22,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:26:22,366 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2024-11-08 17:26:22,412 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-08 17:26:22,496 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6194))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6193) .cse0 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6193) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2024-11-08 17:26:22,568 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6194))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6193) .cse1 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6193) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false [2024-11-08 17:26:22,704 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6191))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6194))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6192) .cse0 v_ArrVal_6193) .cse1 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6191))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6192) .cse6 v_ArrVal_6193) (select (select (store .cse7 .cse6 v_ArrVal_6194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6195))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2024-11-08 17:26:22,788 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6191))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_6194))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6192) .cse1 v_ArrVal_6193) .cse2 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6191))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6192) .cse7 v_ArrVal_6193) (select (select (store .cse8 .cse7 v_ArrVal_6194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6195))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2024-11-08 17:26:25,031 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6288 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6288))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_6191))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_6194))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6287) .cse0 v_ArrVal_6192) .cse1 v_ArrVal_6193) .cse2 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6288 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6288))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_6191))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6287) .cse8 v_ArrVal_6192) .cse9 v_ArrVal_6193) (select (select (store .cse10 .cse9 v_ArrVal_6194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6195))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2024-11-08 17:26:25,053 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:26:25,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445168240] [2024-11-08 17:26:25,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445168240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:26:25,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1032133407] [2024-11-08 17:26:25,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:26:25,053 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:26:25,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:26:25,054 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:26:25,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-08 17:26:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:26:30,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-08 17:26:30,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:26:30,685 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 7 [2024-11-08 17:26:31,062 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:26:31,100 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:26:31,100 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 13 treesize of output 13 [2024-11-08 17:26:31,127 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:26:31,146 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:26:31,284 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:26:31,292 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:26:33,028 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:26:33,028 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:26:33,044 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:26:33,205 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:26:33,206 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:26:33,221 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:26:33,342 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:26:33,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 62 treesize of output 57 [2024-11-08 17:26:33,360 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:26:33,491 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:26:33,491 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:26:33,517 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:26:33,569 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:26:33,584 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:26:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:26:33,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:26:33,684 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6721 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:26:33,728 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6721 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2024-11-08 17:26:33,825 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6719) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6721 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6718))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6719) .cse2 v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-08 17:26:33,983 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6721 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6718))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6719) .cse1 v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6719) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false [2024-11-08 17:26:34,201 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6721 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6716))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6718))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6717) .cse0 v_ArrVal_6719) .cse1 v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6716))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6717) .cse6 v_ArrVal_6719) (select (select (store .cse7 .cse6 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6720))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2024-11-08 17:26:44,317 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6721 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6813))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_6716))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_6718))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6812) .cse0 v_ArrVal_6717) .cse1 v_ArrVal_6719) .cse2 v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_6716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6813))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_6716))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6812) .cse8 v_ArrVal_6717) .cse9 v_ArrVal_6719) (select (select (store .cse10 .cse9 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6720))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse7) (bvadd (_ bv24 32) .cse7)))))) is different from false [2024-11-08 17:26:44,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1032133407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:26:44,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:26:44,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2024-11-08 17:26:44,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075595408] [2024-11-08 17:26:44,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:26:44,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:26:44,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:26:44,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:26:44,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=20, NotChecked=520, Total=812 [2024-11-08 17:26:44,364 INFO L87 Difference]: Start difference. First operand 569 states and 609 transitions. Second operand has 13 states, 11 states have (on average 10.0) internal successors, (110), 13 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:27:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:27:58,517 INFO L93 Difference]: Finished difference Result 568 states and 608 transitions. [2024-11-08 17:27:58,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:27:58,518 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 10.0) internal successors, (110), 13 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2024-11-08 17:27:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:27:58,519 INFO L225 Difference]: With dead ends: 568 [2024-11-08 17:27:58,520 INFO L226 Difference]: Without dead ends: 568 [2024-11-08 17:27:58,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 244 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=126, Invalid=458, Unknown=20, NotChecked=728, Total=1332 [2024-11-08 17:27:58,520 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 381 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 2957 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:27:58,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1631 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2957 Invalid, 0 Unknown, 0 Unchecked, 68.9s Time] [2024-11-08 17:27:58,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-08 17:27:58,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2024-11-08 17:27:58,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 403 states have (on average 1.4913151364764268) internal successors, (601), 562 states have internal predecessors, (601), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:27:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 608 transitions. [2024-11-08 17:27:58,535 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 608 transitions. Word has length 125 [2024-11-08 17:27:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:27:58,536 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 608 transitions. [2024-11-08 17:27:58,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 10.0) internal successors, (110), 13 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:27:58,536 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 608 transitions. [2024-11-08 17:27:58,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 17:27:58,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:27:58,538 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:58,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-11-08 17:27:58,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2024-11-08 17:27:58,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 17:27:58,939 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 17:27:58,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:27:58,940 INFO L85 PathProgramCache]: Analyzing trace with hash 565230538, now seen corresponding path program 1 times [2024-11-08 17:27:58,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:27:58,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1178422008] [2024-11-08 17:27:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:27:58,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:27:58,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:27:58,941 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:27:58,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-08 17:27:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:27:59,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-08 17:27:59,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:28:02,413 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:28:02,414 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 13 treesize of output 13 [2024-11-08 17:28:02,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 17:28:11,383 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:28:11,383 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 44 treesize of output 43 [2024-11-08 17:28:13,143 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:28:13,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-08 17:28:14,495 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:28:14,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 44 treesize of output 43 [2024-11-08 17:28:15,740 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:28:15,740 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 44 treesize of output 43 [2024-11-08 17:28:17,198 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:28:17,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-08 17:28:17,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-08 17:28:18,570 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-08 17:28:18,570 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 21 treesize of output 20 [2024-11-08 17:28:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:28:18,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:28:20,195 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7205) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-08 17:28:20,311 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_7205) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 17:28:20,481 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7204))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:28:20,596 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_7204))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:28:20,769 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7203))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7204)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:28:20,894 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7203))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7204)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:28:21,076 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7202))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7203)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7204)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:28:21,203 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7202))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7203)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7204)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:28:24,947 INFO L349 Elim1Store]: treesize reduction 7, result has 96.5 percent of original size [2024-11-08 17:28:24,947 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 205 treesize of output 204 [2024-11-08 17:28:25,065 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7252))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7202)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7203)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7204)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2024-11-08 17:28:25,096 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:28:25,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178422008] [2024-11-08 17:28:25,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178422008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:28:25,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [209316521] [2024-11-08 17:28:25,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:28:25,096 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:28:25,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:28:25,098 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:28:25,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f890db4-2d55-49fd-9224-9bf16aef740a/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-08 17:28:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:29,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-08 17:28:29,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:28:30,389 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 17:28:30,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-08 17:28:37,757 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-08 17:28:37,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-08 17:28:39,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 17:28:42,337 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 34 treesize of output 16