./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU --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 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:11:41,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:11:41,504 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:11:41,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:11:41,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:11:41,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:11:41,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:11:41,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:11:41,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:11:41,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:11:41,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:11:41,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:11:41,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:11:41,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:11:41,546 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:11:41,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:11:41,547 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:11:41,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:11:41,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:11:41,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:11:41,550 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:11:41,550 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:11:41,551 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:11:41,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:11:41,552 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:11:41,552 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:11:41,553 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:11:41,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:11:41,554 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:11:41,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:11:41,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:11:41,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:11:41,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:11:41,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:11:41,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:11:41,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:11:41,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:11:41,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:11:41,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:11:41,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:11:41,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:11:41,561 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:11:41,562 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_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/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_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f [2024-10-31 22:11:41,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:11:41,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:11:41,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:11:41,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:11:41,939 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:11:41,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/forester-heap/sll-sorted-2.i Unable to find full path for "g++" [2024-10-31 22:11:44,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:11:44,434 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:11:44,437 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/sv-benchmarks/c/forester-heap/sll-sorted-2.i [2024-10-31 22:11:44,450 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/data/81220b362/66a2c0f9720d46429b7d94dead128cf9/FLAG6b4ef405d [2024-10-31 22:11:44,464 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/data/81220b362/66a2c0f9720d46429b7d94dead128cf9 [2024-10-31 22:11:44,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:11:44,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:11:44,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:11:44,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:11:44,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:11:44,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:11:44" (1/1) ... [2024-10-31 22:11:44,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51d81f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:44, skipping insertion in model container [2024-10-31 22:11:44,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:11:44" (1/1) ... [2024-10-31 22:11:44,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:11:44,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:11:44,962 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:11:45,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:11:45,066 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:11:45,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:45 WrapperNode [2024-10-31 22:11:45,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:11:45,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:11:45,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:11:45,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:11:45,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:45" (1/1) ... [2024-10-31 22:11:45,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:45" (1/1) ... [2024-10-31 22:11:45,138 INFO L138 Inliner]: procedures = 119, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 201 [2024-10-31 22:11:45,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:11:45,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:11:45,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:11:45,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:11:45,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:45" (1/1) ... [2024-10-31 22:11:45,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:45" (1/1) ... [2024-10-31 22:11:45,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:45" (1/1) ... [2024-10-31 22:11:45,179 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2024-10-31 22:11:45,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:45" (1/1) ... [2024-10-31 22:11:45,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:45" (1/1) ... [2024-10-31 22:11:45,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:45" (1/1) ... [2024-10-31 22:11:45,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:45" (1/1) ... [2024-10-31 22:11:45,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:45" (1/1) ... [2024-10-31 22:11:45,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:45" (1/1) ... [2024-10-31 22:11:45,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:11:45,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:11:45,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:11:45,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:11:45,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:45" (1/1) ... [2024-10-31 22:11:45,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:11:45,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:11:45,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:11:45,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:11:45,298 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-31 22:11:45,298 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-31 22:11:45,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:11:45,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:11:45,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:11:45,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:11:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:11:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:11:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-31 22:11:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-31 22:11:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-31 22:11:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-31 22:11:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:11:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:11:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:11:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:11:45,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:11:45,450 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:11:45,452 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:11:45,986 INFO L? ?]: Removed 143 outVars from TransFormulas that were not future-live. [2024-10-31 22:11:45,987 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:11:46,009 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:11:46,011 INFO L316 CfgBuilder]: Removed 20 assume(true) statements. [2024-10-31 22:11:46,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:11:46 BoogieIcfgContainer [2024-10-31 22:11:46,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:11:46,017 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:11:46,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:11:46,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:11:46,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:11:44" (1/3) ... [2024-10-31 22:11:46,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386fa239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:11:46, skipping insertion in model container [2024-10-31 22:11:46,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:45" (2/3) ... [2024-10-31 22:11:46,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386fa239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:11:46, skipping insertion in model container [2024-10-31 22:11:46,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:11:46" (3/3) ... [2024-10-31 22:11:46,025 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2024-10-31 22:11:46,044 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:11:46,044 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2024-10-31 22:11:46,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:11:46,096 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;@4e805966, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:11:46,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-10-31 22:11:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 97 states have (on average 2.082474226804124) internal successors, (202), 162 states have internal predecessors, (202), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-31 22:11:46,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-31 22:11:46,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:46,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-31 22:11:46,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:11:46,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:46,114 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-10-31 22:11:46,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:46,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016879574] [2024-10-31 22:11:46,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:46,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:46,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:46,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016879574] [2024-10-31 22:11:46,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016879574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:46,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:46,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:11:46,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488091815] [2024-10-31 22:11:46,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:46,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:11:46,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:46,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:11:46,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:11:46,388 INFO L87 Difference]: Start difference. First operand has 171 states, 97 states have (on average 2.082474226804124) internal successors, (202), 162 states have internal predecessors, (202), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-31 22:11:46,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:46,608 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2024-10-31 22:11:46,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:11:46,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-10-31 22:11:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:46,622 INFO L225 Difference]: With dead ends: 160 [2024-10-31 22:11:46,623 INFO L226 Difference]: Without dead ends: 158 [2024-10-31 22:11:46,624 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-10-31 22:11:46,631 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 145 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:46,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 122 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:11:46,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-31 22:11:46,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-10-31 22:11:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 88 states have (on average 1.9090909090909092) internal successors, (168), 156 states have internal predecessors, (168), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2024-10-31 22:11:46,691 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 3 [2024-10-31 22:11:46,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:46,691 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2024-10-31 22:11:46,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-31 22:11:46,692 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2024-10-31 22:11:46,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-31 22:11:46,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:46,694 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-31 22:11:46,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:11:46,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:11:46,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:46,697 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-10-31 22:11:46,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:46,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274148718] [2024-10-31 22:11:46,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:46,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:46,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:46,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274148718] [2024-10-31 22:11:46,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274148718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:46,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:46,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:11:46,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889085553] [2024-10-31 22:11:46,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:46,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:11:46,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:46,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:11:46,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:11:46,861 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-31 22:11:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:47,065 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2024-10-31 22:11:47,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:11:47,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-10-31 22:11:47,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:47,069 INFO L225 Difference]: With dead ends: 156 [2024-10-31 22:11:47,069 INFO L226 Difference]: Without dead ends: 156 [2024-10-31 22:11:47,069 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-10-31 22:11:47,070 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 145 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:47,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 118 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:11:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-31 22:11:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-10-31 22:11:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 88 states have (on average 1.8863636363636365) internal successors, (166), 154 states have internal predecessors, (166), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 173 transitions. [2024-10-31 22:11:47,092 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 173 transitions. Word has length 3 [2024-10-31 22:11:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:47,093 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 173 transitions. [2024-10-31 22:11:47,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-31 22:11:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 173 transitions. [2024-10-31 22:11:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-31 22:11:47,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:47,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:47,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:11:47,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:11:47,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:47,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1771462867, now seen corresponding path program 1 times [2024-10-31 22:11:47,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:47,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146549378] [2024-10-31 22:11:47,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:47,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:47,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:47,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146549378] [2024-10-31 22:11:47,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146549378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:47,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:47,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:11:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435702794] [2024-10-31 22:11:47,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:47,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:11:47,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:47,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:11:47,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:47,345 INFO L87 Difference]: Start difference. First operand 156 states and 173 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:47,650 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2024-10-31 22:11:47,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:11:47,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-31 22:11:47,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:47,653 INFO L225 Difference]: With dead ends: 155 [2024-10-31 22:11:47,653 INFO L226 Difference]: Without dead ends: 155 [2024-10-31 22:11:47,653 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-10-31 22:11:47,657 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 226 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:47,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 94 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:11:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-31 22:11:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2024-10-31 22:11:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 102 states have (on average 1.7058823529411764) internal successors, (174), 151 states have internal predecessors, (174), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 181 transitions. [2024-10-31 22:11:47,675 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 181 transitions. Word has length 8 [2024-10-31 22:11:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:47,676 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 181 transitions. [2024-10-31 22:11:47,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 181 transitions. [2024-10-31 22:11:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-31 22:11:47,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:47,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:47,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:11:47,677 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:11:47,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1771462866, now seen corresponding path program 1 times [2024-10-31 22:11:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:47,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218313177] [2024-10-31 22:11:47,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:47,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:47,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:47,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218313177] [2024-10-31 22:11:47,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218313177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:47,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:47,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:11:47,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825565220] [2024-10-31 22:11:47,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:47,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:11:47,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:47,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:11:47,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:47,914 INFO L87 Difference]: Start difference. First operand 153 states and 181 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:48,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:48,238 INFO L93 Difference]: Finished difference Result 216 states and 253 transitions. [2024-10-31 22:11:48,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:11:48,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-31 22:11:48,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:48,241 INFO L225 Difference]: With dead ends: 216 [2024-10-31 22:11:48,243 INFO L226 Difference]: Without dead ends: 216 [2024-10-31 22:11:48,244 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-10-31 22:11:48,245 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 271 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:48,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 151 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:11:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-31 22:11:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 202. [2024-10-31 22:11:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 151 states have (on average 1.5894039735099337) internal successors, (240), 200 states have internal predecessors, (240), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 247 transitions. [2024-10-31 22:11:48,260 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 247 transitions. Word has length 8 [2024-10-31 22:11:48,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:48,260 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 247 transitions. [2024-10-31 22:11:48,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 247 transitions. [2024-10-31 22:11:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-31 22:11:48,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:48,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:48,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:11:48,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:11:48,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:48,263 INFO L85 PathProgramCache]: Analyzing trace with hash -75905222, now seen corresponding path program 1 times [2024-10-31 22:11:48,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:48,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157188153] [2024-10-31 22:11:48,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:48,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:48,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:48,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157188153] [2024-10-31 22:11:48,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157188153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:48,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:48,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:11:48,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735066555] [2024-10-31 22:11:48,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:48,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:11:48,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:48,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:11:48,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:11:48,304 INFO L87 Difference]: Start difference. First operand 202 states and 247 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:48,335 INFO L93 Difference]: Finished difference Result 242 states and 290 transitions. [2024-10-31 22:11:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:11:48,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-31 22:11:48,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:48,337 INFO L225 Difference]: With dead ends: 242 [2024-10-31 22:11:48,338 INFO L226 Difference]: Without dead ends: 242 [2024-10-31 22:11:48,338 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-10-31 22:11:48,339 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 50 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:48,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 320 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:11:48,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-31 22:11:48,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 212. [2024-10-31 22:11:48,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 161 states have (on average 1.5776397515527951) internal successors, (254), 210 states have internal predecessors, (254), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:48,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 261 transitions. [2024-10-31 22:11:48,358 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 261 transitions. Word has length 12 [2024-10-31 22:11:48,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:48,359 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 261 transitions. [2024-10-31 22:11:48,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 261 transitions. [2024-10-31 22:11:48,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-31 22:11:48,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:48,360 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:48,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:11:48,364 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:11:48,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:48,365 INFO L85 PathProgramCache]: Analyzing trace with hash -50514577, now seen corresponding path program 1 times [2024-10-31 22:11:48,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:48,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222037248] [2024-10-31 22:11:48,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:48,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:48,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:48,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222037248] [2024-10-31 22:11:48,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222037248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:48,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:48,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:11:48,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982833348] [2024-10-31 22:11:48,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:48,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:11:48,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:48,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:11:48,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:11:48,538 INFO L87 Difference]: Start difference. First operand 212 states and 261 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-10-31 22:11:49,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:49,008 INFO L93 Difference]: Finished difference Result 215 states and 265 transitions. [2024-10-31 22:11:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:11:49,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2024-10-31 22:11:49,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:49,013 INFO L225 Difference]: With dead ends: 215 [2024-10-31 22:11:49,016 INFO L226 Difference]: Without dead ends: 215 [2024-10-31 22:11:49,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:11:49,021 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 69 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:49,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 361 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:11:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-31 22:11:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2024-10-31 22:11:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.565217391304348) internal successors, (252), 209 states have internal predecessors, (252), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 259 transitions. [2024-10-31 22:11:49,045 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 259 transitions. Word has length 12 [2024-10-31 22:11:49,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:49,045 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 259 transitions. [2024-10-31 22:11:49,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-10-31 22:11:49,046 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 259 transitions. [2024-10-31 22:11:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-31 22:11:49,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:49,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:49,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:11:49,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:11:49,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:49,048 INFO L85 PathProgramCache]: Analyzing trace with hash -50514576, now seen corresponding path program 1 times [2024-10-31 22:11:49,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:49,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119370566] [2024-10-31 22:11:49,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:49,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:49,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:49,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119370566] [2024-10-31 22:11:49,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119370566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:49,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:49,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:11:49,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193603738] [2024-10-31 22:11:49,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:49,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:11:49,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:49,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:11:49,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:11:49,322 INFO L87 Difference]: Start difference. First operand 211 states and 259 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-10-31 22:11:49,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:49,661 INFO L93 Difference]: Finished difference Result 206 states and 251 transitions. [2024-10-31 22:11:49,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:11:49,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2024-10-31 22:11:49,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:49,663 INFO L225 Difference]: With dead ends: 206 [2024-10-31 22:11:49,663 INFO L226 Difference]: Without dead ends: 206 [2024-10-31 22:11:49,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:11:49,665 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 12 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:49,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 466 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:11:49,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-31 22:11:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 201. [2024-10-31 22:11:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 199 states have internal predecessors, (239), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:49,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 246 transitions. [2024-10-31 22:11:49,673 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 246 transitions. Word has length 12 [2024-10-31 22:11:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:49,674 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 246 transitions. [2024-10-31 22:11:49,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-10-31 22:11:49,674 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 246 transitions. [2024-10-31 22:11:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-31 22:11:49,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:49,675 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:49,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:11:49,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:11:49,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:49,676 INFO L85 PathProgramCache]: Analyzing trace with hash -264898860, now seen corresponding path program 1 times [2024-10-31 22:11:49,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:49,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743586347] [2024-10-31 22:11:49,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:49,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 22:11:49,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:49,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743586347] [2024-10-31 22:11:49,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743586347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:49,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:49,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:49,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583254218] [2024-10-31 22:11:49,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:49,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:11:49,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:49,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:11:49,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:49,782 INFO L87 Difference]: Start difference. First operand 201 states and 246 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:49,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:49,939 INFO L93 Difference]: Finished difference Result 218 states and 252 transitions. [2024-10-31 22:11:49,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:11:49,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-31 22:11:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:49,941 INFO L225 Difference]: With dead ends: 218 [2024-10-31 22:11:49,941 INFO L226 Difference]: Without dead ends: 218 [2024-10-31 22:11:49,942 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-10-31 22:11:49,943 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 250 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:49,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 208 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-31 22:11:49,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 200. [2024-10-31 22:11:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 156 states have (on average 1.5128205128205128) internal successors, (236), 198 states have internal predecessors, (236), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 242 transitions. [2024-10-31 22:11:49,950 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 242 transitions. Word has length 23 [2024-10-31 22:11:49,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:49,952 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 242 transitions. [2024-10-31 22:11:49,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 242 transitions. [2024-10-31 22:11:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:11:49,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:49,953 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:11:49,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:11:49,954 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:11:49,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:49,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1632603559, now seen corresponding path program 1 times [2024-10-31 22:11:49,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:49,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133548777] [2024-10-31 22:11:49,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:49,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:50,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:50,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:50,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133548777] [2024-10-31 22:11:50,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133548777] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:11:50,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743834165] [2024-10-31 22:11:50,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:50,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:11:50,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:11:50,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:11:50,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:11:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:50,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-31 22:11:50,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:11:50,749 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-10-31 22:11:50,888 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-31 22:11:50,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-31 22:11:50,995 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 15 treesize of output 1 [2024-10-31 22:11:51,188 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-31 22:11:51,188 INFO L378 Elim1Store]: Elim1 eliminated variable 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 33 treesize of output 24 [2024-10-31 22:11:51,315 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-31 22:11:51,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-31 22:11:51,577 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 25 treesize of output 13 [2024-10-31 22:11:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:51,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:11:52,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:11:52,165 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-10-31 22:11:52,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:11:52,182 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 34 treesize of output 37 [2024-10-31 22:11:52,193 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 11 treesize of output 9 [2024-10-31 22:11:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:53,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743834165] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:11:53,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:11:53,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2024-10-31 22:11:53,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459697203] [2024-10-31 22:11:53,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:11:53,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-31 22:11:53,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:53,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-31 22:11:53,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=738, Unknown=9, NotChecked=0, Total=870 [2024-10-31 22:11:53,143 INFO L87 Difference]: Start difference. First operand 200 states and 242 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 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-10-31 22:11:54,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:54,642 INFO L93 Difference]: Finished difference Result 305 states and 353 transitions. [2024-10-31 22:11:54,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:11:54,643 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 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 27 [2024-10-31 22:11:54,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:54,644 INFO L225 Difference]: With dead ends: 305 [2024-10-31 22:11:54,645 INFO L226 Difference]: Without dead ends: 305 [2024-10-31 22:11:54,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=208, Invalid=1043, Unknown=9, NotChecked=0, Total=1260 [2024-10-31 22:11:54,646 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 1082 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:54,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 1032 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-31 22:11:54,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-31 22:11:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 222. [2024-10-31 22:11:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 178 states have (on average 1.4775280898876404) internal successors, (263), 220 states have internal predecessors, (263), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 269 transitions. [2024-10-31 22:11:54,658 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 269 transitions. Word has length 27 [2024-10-31 22:11:54,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:54,658 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 269 transitions. [2024-10-31 22:11:54,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 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-10-31 22:11:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 269 transitions. [2024-10-31 22:11:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:11:54,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:54,660 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:11:54,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 22:11:54,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-31 22:11:54,864 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:11:54,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:54,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1632603558, now seen corresponding path program 1 times [2024-10-31 22:11:54,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:54,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349658328] [2024-10-31 22:11:54,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:54,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:55,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:55,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349658328] [2024-10-31 22:11:55,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349658328] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:11:55,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492221615] [2024-10-31 22:11:55,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:55,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:11:55,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:11:55,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:11:55,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 22:11:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-31 22:11:55,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:11:55,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 6 treesize of output 5 [2024-10-31 22:11:55,763 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-10-31 22:11:55,783 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-31 22:11:55,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 11 treesize of output 11 [2024-10-31 22:11:55,840 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-10-31 22:11:55,849 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 15 treesize of output 1 [2024-10-31 22:11:56,016 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-31 22:11:56,017 INFO L378 Elim1Store]: Elim1 eliminated variable 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 16 treesize of output 15 [2024-10-31 22:11:56,039 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-31 22:11:56,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-31 22:11:56,138 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-31 22:11:56,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-31 22:11:56,149 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 24 treesize of output 11 [2024-10-31 22:11:56,345 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 25 treesize of output 13 [2024-10-31 22:11:56,350 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 7 treesize of output 3 [2024-10-31 22:11:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:56,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:11:56,722 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_276 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int) (v_ArrVal_277 (Array Int Int))) (or (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) 7) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_277) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0))) (forall ((v_ArrVal_276 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int)) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) 5)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0)))) is different from false [2024-10-31 22:11:56,865 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_276 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int) (v_ArrVal_277 (Array Int Int))) (or (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) 7) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_277) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0))) (forall ((v_ArrVal_276 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) 5)) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0)))) is different from false [2024-10-31 22:11:56,901 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_276 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int) (v_ArrVal_277 (Array Int Int))) (or (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_276) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_277) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0))) (forall ((v_ArrVal_276 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int)) (or (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_276) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0))))) is different from false [2024-10-31 22:11:56,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:11:56,953 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-10-31 22:11:56,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:11:56,962 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-10-31 22:11:56,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:11:56,976 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 52 treesize of output 55 [2024-10-31 22:11:56,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:11:56,996 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 82 treesize of output 81 [2024-10-31 22:11:57,013 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 15 treesize of output 13 [2024-10-31 22:11:57,021 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 13 treesize of output 11 [2024-10-31 22:11:57,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:11:57,099 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-10-31 22:11:57,104 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-31 22:11:57,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-31 22:11:57,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-31 22:11:57,113 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-31 22:11:57,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:57,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492221615] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:11:57,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:11:57,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2024-10-31 22:11:57,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595654114] [2024-10-31 22:11:57,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:11:57,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-31 22:11:57,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:57,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-31 22:11:57,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=659, Unknown=3, NotChecked=162, Total=930 [2024-10-31 22:11:57,411 INFO L87 Difference]: Start difference. First operand 222 states and 269 transitions. Second operand has 31 states, 30 states have (on average 2.6) internal successors, (78), 31 states have internal predecessors, (78), 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-10-31 22:11:59,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:59,112 INFO L93 Difference]: Finished difference Result 304 states and 352 transitions. [2024-10-31 22:11:59,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:11:59,113 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6) internal successors, (78), 31 states have internal predecessors, (78), 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 27 [2024-10-31 22:11:59,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:59,116 INFO L225 Difference]: With dead ends: 304 [2024-10-31 22:11:59,116 INFO L226 Difference]: Without dead ends: 304 [2024-10-31 22:11:59,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=234, Invalid=1107, Unknown=3, NotChecked=216, Total=1560 [2024-10-31 22:11:59,118 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 705 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 913 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:59,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 983 Invalid, 2290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1336 Invalid, 0 Unknown, 913 Unchecked, 1.3s Time] [2024-10-31 22:11:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-31 22:11:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 222. [2024-10-31 22:11:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 178 states have (on average 1.4719101123595506) internal successors, (262), 220 states have internal predecessors, (262), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 268 transitions. [2024-10-31 22:11:59,126 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 268 transitions. Word has length 27 [2024-10-31 22:11:59,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:59,127 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 268 transitions. [2024-10-31 22:11:59,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6) internal successors, (78), 31 states have internal predecessors, (78), 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-10-31 22:11:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 268 transitions. [2024-10-31 22:11:59,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-31 22:11:59,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:59,129 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:11:59,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-31 22:11:59,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-31 22:11:59,334 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:11:59,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:59,334 INFO L85 PathProgramCache]: Analyzing trace with hash 118027743, now seen corresponding path program 1 times [2024-10-31 22:11:59,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:59,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133777666] [2024-10-31 22:11:59,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:59,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 22:11:59,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:59,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133777666] [2024-10-31 22:11:59,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133777666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:59,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:59,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:11:59,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104400025] [2024-10-31 22:11:59,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:59,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:11:59,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:59,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:11:59,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:11:59,391 INFO L87 Difference]: Start difference. First operand 222 states and 268 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:59,405 INFO L93 Difference]: Finished difference Result 224 states and 270 transitions. [2024-10-31 22:11:59,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:11:59,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-31 22:11:59,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:59,408 INFO L225 Difference]: With dead ends: 224 [2024-10-31 22:11:59,408 INFO L226 Difference]: Without dead ends: 224 [2024-10-31 22:11:59,408 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-10-31 22:11:59,409 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:59,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:11:59,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-31 22:11:59,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-10-31 22:11:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 180 states have (on average 1.4666666666666666) internal successors, (264), 222 states have internal predecessors, (264), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 270 transitions. [2024-10-31 22:11:59,415 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 270 transitions. Word has length 31 [2024-10-31 22:11:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:59,416 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 270 transitions. [2024-10-31 22:11:59,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 270 transitions. [2024-10-31 22:11:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-31 22:11:59,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:59,418 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:11:59,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:11:59,419 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:11:59,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:59,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1591983306, now seen corresponding path program 1 times [2024-10-31 22:11:59,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:59,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156793364] [2024-10-31 22:11:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:59,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 22:11:59,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:59,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156793364] [2024-10-31 22:11:59,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156793364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:59,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:59,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:11:59,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847357689] [2024-10-31 22:11:59,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:59,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:11:59,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:59,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:11:59,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:11:59,614 INFO L87 Difference]: Start difference. First operand 224 states and 270 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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-10-31 22:11:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:59,916 INFO L93 Difference]: Finished difference Result 240 states and 289 transitions. [2024-10-31 22:11:59,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:11:59,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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-10-31 22:11:59,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:59,917 INFO L225 Difference]: With dead ends: 240 [2024-10-31 22:11:59,917 INFO L226 Difference]: Without dead ends: 240 [2024-10-31 22:11:59,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:11:59,918 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 16 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:59,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 619 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:11:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-31 22:11:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 232. [2024-10-31 22:11:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 188 states have (on average 1.452127659574468) internal successors, (273), 230 states have internal predecessors, (273), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 279 transitions. [2024-10-31 22:11:59,924 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 279 transitions. Word has length 32 [2024-10-31 22:11:59,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:59,925 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 279 transitions. [2024-10-31 22:11:59,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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-10-31 22:11:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 279 transitions. [2024-10-31 22:11:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-31 22:11:59,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:59,926 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:11:59,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:11:59,927 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:11:59,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:59,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1591923724, now seen corresponding path program 1 times [2024-10-31 22:11:59,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:59,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86353507] [2024-10-31 22:11:59,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:59,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 22:12:00,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:12:00,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86353507] [2024-10-31 22:12:00,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86353507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:12:00,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:12:00,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:12:00,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718812432] [2024-10-31 22:12:00,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:12:00,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:12:00,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:12:00,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:12:00,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:12:00,036 INFO L87 Difference]: Start difference. First operand 232 states and 279 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-10-31 22:12:00,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:12:00,115 INFO L93 Difference]: Finished difference Result 229 states and 273 transitions. [2024-10-31 22:12:00,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:12:00,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-10-31 22:12:00,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:12:00,117 INFO L225 Difference]: With dead ends: 229 [2024-10-31 22:12:00,117 INFO L226 Difference]: Without dead ends: 229 [2024-10-31 22:12:00,117 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-10-31 22:12:00,118 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 12 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:12:00,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 226 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:12:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-31 22:12:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-10-31 22:12:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 188 states have (on average 1.4202127659574468) internal successors, (267), 227 states have internal predecessors, (267), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:12:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 273 transitions. [2024-10-31 22:12:00,124 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 273 transitions. Word has length 32 [2024-10-31 22:12:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:12:00,124 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 273 transitions. [2024-10-31 22:12:00,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-10-31 22:12:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 273 transitions. [2024-10-31 22:12:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-31 22:12:00,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:12:00,125 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:12:00,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:12:00,126 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:12:00,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:12:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1591923723, now seen corresponding path program 1 times [2024-10-31 22:12:00,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:12:00,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792990281] [2024-10-31 22:12:00,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:00,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:12:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 22:12:00,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:12:00,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792990281] [2024-10-31 22:12:00,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792990281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:12:00,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:12:00,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:12:00,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380622814] [2024-10-31 22:12:00,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:12:00,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:12:00,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:12:00,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:12:00,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:12:00,217 INFO L87 Difference]: Start difference. First operand 229 states and 273 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-10-31 22:12:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:12:00,312 INFO L93 Difference]: Finished difference Result 226 states and 267 transitions. [2024-10-31 22:12:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:12:00,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-10-31 22:12:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:12:00,314 INFO L225 Difference]: With dead ends: 226 [2024-10-31 22:12:00,314 INFO L226 Difference]: Without dead ends: 226 [2024-10-31 22:12:00,314 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-10-31 22:12:00,315 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 12 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:12:00,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 216 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:12:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-31 22:12:00,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-10-31 22:12:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 188 states have (on average 1.3882978723404256) internal successors, (261), 224 states have internal predecessors, (261), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:12:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 267 transitions. [2024-10-31 22:12:00,321 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 267 transitions. Word has length 32 [2024-10-31 22:12:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:12:00,322 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 267 transitions. [2024-10-31 22:12:00,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-10-31 22:12:00,323 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 267 transitions. [2024-10-31 22:12:00,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-31 22:12:00,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:12:00,328 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:12:00,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:12:00,328 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:12:00,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:12:00,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1465351892, now seen corresponding path program 1 times [2024-10-31 22:12:00,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:12:00,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596082148] [2024-10-31 22:12:00,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:00,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:12:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:12:01,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:12:01,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596082148] [2024-10-31 22:12:01,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596082148] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:12:01,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107779411] [2024-10-31 22:12:01,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:01,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:12:01,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:12:01,219 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:12:01,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-31 22:12:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:01,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-31 22:12:01,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:12:01,357 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-10-31 22:12:01,370 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-10-31 22:12:01,473 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-31 22:12:01,474 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-10-31 22:12:01,531 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 15 treesize of output 1 [2024-10-31 22:12:01,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-31 22:12:01,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-31 22:12:01,609 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 16 treesize of output 8 [2024-10-31 22:12:01,682 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 16 treesize of output 11 [2024-10-31 22:12:01,715 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 16 treesize of output 11 [2024-10-31 22:12:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:12:01,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:12:02,375 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_494) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_79|)) 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (not (= v_ArrVal_492 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_492 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) is different from false [2024-10-31 22:12:02,543 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_16| Int) (v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_81| Int) (v_ArrVal_494 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_81|) (not (= v_ArrVal_492 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81| (select v_ArrVal_492 |v_ULTIMATE.start_main_~x~0#1.offset_81|)))) (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) |v_ULTIMATE.start_main_#t~malloc3#1.base_16| v_ArrVal_494) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_79|)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_16|) 0)))) is different from false [2024-10-31 22:12:02,559 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 40 treesize of output 38 [2024-10-31 22:12:02,566 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 11 treesize of output 7 [2024-10-31 22:12:02,573 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-31 22:12:02,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:12:02,579 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 1 case distinctions, treesize of input 14 treesize of output 8 [2024-10-31 22:12:02,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:12:02,592 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 21 [2024-10-31 22:12:02,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:12:02,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107779411] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:12:02,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:12:02,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 35 [2024-10-31 22:12:02,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246708451] [2024-10-31 22:12:02,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:12:02,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-31 22:12:02,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:12:02,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-31 22:12:02,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=936, Unknown=10, NotChecked=126, Total=1190 [2024-10-31 22:12:02,688 INFO L87 Difference]: Start difference. First operand 226 states and 267 transitions. Second operand has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:12:03,474 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) 0))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (.cse4 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) 0) 0)) (.cse5 (= |c_ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (not (= (select (select |c_#memory_int#1| .cse0) 4) 0)) .cse1 (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_494) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_79|)) 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (not (= v_ArrVal_492 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_492 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) .cse3 (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) 4) 0) .cse4 .cse5 (or (= |c_ULTIMATE.start_main_~marked~0#1| 0) (and .cse1 .cse3 .cse4 .cse5 (= |c_ULTIMATE.start_main_~marked~0#1| 1))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_16| Int)) (or (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_492) |v_ULTIMATE.start_main_#t~malloc3#1.base_16| v_ArrVal_494) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_79|)) 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (not (= v_ArrVal_492 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_492 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_16|) 0))))))) is different from false [2024-10-31 22:12:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:12:07,226 INFO L93 Difference]: Finished difference Result 541 states and 635 transitions. [2024-10-31 22:12:07,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-31 22:12:07,227 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-31 22:12:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:12:07,229 INFO L225 Difference]: With dead ends: 541 [2024-10-31 22:12:07,229 INFO L226 Difference]: Without dead ends: 541 [2024-10-31 22:12:07,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=719, Invalid=3967, Unknown=18, NotChecked=408, Total=5112 [2024-10-31 22:12:07,231 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 936 mSDsluCounter, 2064 mSDsCounter, 0 mSdLazyCounter, 1875 mSolverCounterSat, 109 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1875 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 868 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:12:07,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 2171 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1875 Invalid, 41 Unknown, 868 Unchecked, 2.3s Time] [2024-10-31 22:12:07,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-10-31 22:12:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 274. [2024-10-31 22:12:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 236 states have (on average 1.3559322033898304) internal successors, (320), 272 states have internal predecessors, (320), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:12:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 326 transitions. [2024-10-31 22:12:07,241 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 326 transitions. Word has length 34 [2024-10-31 22:12:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:12:07,242 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 326 transitions. [2024-10-31 22:12:07,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:12:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 326 transitions. [2024-10-31 22:12:07,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-31 22:12:07,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:12:07,243 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:12:07,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-31 22:12:07,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-31 22:12:07,448 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:12:07,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:12:07,448 INFO L85 PathProgramCache]: Analyzing trace with hash 978750614, now seen corresponding path program 1 times [2024-10-31 22:12:07,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:12:07,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018504509] [2024-10-31 22:12:07,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:12:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:07,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 22:12:07,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:12:07,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018504509] [2024-10-31 22:12:07,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018504509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:12:07,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:12:07,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:12:07,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968708289] [2024-10-31 22:12:07,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:12:07,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:12:07,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:12:07,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:12:07,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:12:07,577 INFO L87 Difference]: Start difference. First operand 274 states and 326 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-10-31 22:12:07,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:12:07,910 INFO L93 Difference]: Finished difference Result 291 states and 349 transitions. [2024-10-31 22:12:07,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:12:07,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 36 [2024-10-31 22:12:07,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:12:07,912 INFO L225 Difference]: With dead ends: 291 [2024-10-31 22:12:07,912 INFO L226 Difference]: Without dead ends: 291 [2024-10-31 22:12:07,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:12:07,913 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 71 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:12:07,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 331 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:12:07,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-31 22:12:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 281. [2024-10-31 22:12:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 243 states have (on average 1.3662551440329218) internal successors, (332), 279 states have internal predecessors, (332), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:12:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 338 transitions. [2024-10-31 22:12:07,924 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 338 transitions. Word has length 36 [2024-10-31 22:12:07,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:12:07,925 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 338 transitions. [2024-10-31 22:12:07,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-10-31 22:12:07,925 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 338 transitions. [2024-10-31 22:12:07,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-31 22:12:07,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:12:07,926 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:12:07,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:12:07,926 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:12:07,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:12:07,927 INFO L85 PathProgramCache]: Analyzing trace with hash 978750615, now seen corresponding path program 1 times [2024-10-31 22:12:07,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:12:07,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481774735] [2024-10-31 22:12:07,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:07,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:12:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:12:08,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:12:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481774735] [2024-10-31 22:12:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481774735] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:12:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251073135] [2024-10-31 22:12:08,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:08,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:12:08,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:12:08,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:12:08,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-31 22:12:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:08,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-31 22:12:08,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:12:08,809 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 15 [2024-10-31 22:12:08,813 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 28 treesize of output 16 [2024-10-31 22:12:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 22:12:08,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:12:08,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251073135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:12:08,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-31 22:12:08,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 18 [2024-10-31 22:12:08,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426127896] [2024-10-31 22:12:08,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:12:08,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:12:08,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:12:08,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:12:08,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-10-31 22:12:08,876 INFO L87 Difference]: Start difference. First operand 281 states and 338 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-10-31 22:12:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:12:09,342 INFO L93 Difference]: Finished difference Result 289 states and 344 transitions. [2024-10-31 22:12:09,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:12:09,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 36 [2024-10-31 22:12:09,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:12:09,345 INFO L225 Difference]: With dead ends: 289 [2024-10-31 22:12:09,345 INFO L226 Difference]: Without dead ends: 289 [2024-10-31 22:12:09,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-10-31 22:12:09,346 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 42 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:12:09,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 403 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:12:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-31 22:12:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 279. [2024-10-31 22:12:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 243 states have (on average 1.345679012345679) internal successors, (327), 277 states have internal predecessors, (327), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:12:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 333 transitions. [2024-10-31 22:12:09,355 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 333 transitions. Word has length 36 [2024-10-31 22:12:09,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:12:09,356 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 333 transitions. [2024-10-31 22:12:09,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-10-31 22:12:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 333 transitions. [2024-10-31 22:12:09,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-31 22:12:09,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:12:09,357 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:12:09,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-31 22:12:09,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-31 22:12:09,558 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-31 22:12:09,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:12:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1812997249, now seen corresponding path program 2 times [2024-10-31 22:12:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:12:09,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236952851] [2024-10-31 22:12:09,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:12:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:12:10,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:12:10,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236952851] [2024-10-31 22:12:10,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236952851] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:12:10,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075981416] [2024-10-31 22:12:10,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-31 22:12:10,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:12:10,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:12:10,242 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:12:10,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f35fe885-798a-4e97-b903-62244341185a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-31 22:12:10,381 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-31 22:12:10,381 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:12:10,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-31 22:12:10,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:12:10,390 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-10-31 22:12:10,484 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-31 22:12:10,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-10-31 22:12:10,525 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 15 treesize of output 1 [2024-10-31 22:12:10,681 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-31 22:12:10,682 INFO L378 Elim1Store]: Elim1 eliminated variable 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 24 treesize of output 17 [2024-10-31 22:12:10,734 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-31 22:12:10,734 INFO L378 Elim1Store]: Elim1 eliminated variable 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 24 treesize of output 17 [2024-10-31 22:12:10,767 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-31 22:12:10,767 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-10-31 22:12:10,857 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-10-31 22:12:10,857 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 1 case distinctions, treesize of input 31 treesize of output 15 [2024-10-31 22:12:11,096 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2024-10-31 22:12:11,097 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 3 case distinctions, treesize of input 49 treesize of output 44 [2024-10-31 22:12:11,104 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 12 treesize of output 8 [2024-10-31 22:12:11,269 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2024-10-31 22:12:11,270 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 3 case distinctions, treesize of input 58 treesize of output 51