./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya --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 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:59:02,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:59:02,441 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:59:02,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:59:02,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:59:02,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:59:02,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:59:02,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:59:02,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:59:02,469 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:59:02,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:59:02,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:59:02,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:59:02,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:59:02,472 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:59:02,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:59:02,473 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:59:02,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:59:02,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:59:02,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:59:02,474 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:59:02,476 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:59:02,476 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:59:02,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:59:02,477 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:59:02,477 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:59:02,477 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:59:02,477 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:59:02,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:59:02,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:59:02,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:59:02,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:59:02,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:59:02,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:59:02,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:59:02,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:59:02,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:59:02,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:59:02,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:59:02,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:59:02,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:59:02,482 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_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/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_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b [2023-11-29 02:59:02,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:59:02,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:59:02,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:59:02,714 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:59:02,715 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:59:02,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2023-11-29 02:59:05,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:59:05,639 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:59:05,639 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2023-11-29 02:59:05,653 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/data/39f115290/4dade87de27f45dfad9706776fc10717/FLAGc8da61d8e [2023-11-29 02:59:05,667 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/data/39f115290/4dade87de27f45dfad9706776fc10717 [2023-11-29 02:59:05,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:59:05,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:59:05,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:59:05,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:59:05,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:59:05,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:59:05" (1/1) ... [2023-11-29 02:59:05,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@216c9291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:05, skipping insertion in model container [2023-11-29 02:59:05,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:59:05" (1/1) ... [2023-11-29 02:59:05,720 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:59:05,962 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:59:05,971 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:59:06,011 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:59:06,038 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:59:06,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:06 WrapperNode [2023-11-29 02:59:06,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:59:06,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:59:06,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:59:06,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:59:06,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:06" (1/1) ... [2023-11-29 02:59:06,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:06" (1/1) ... [2023-11-29 02:59:06,082 INFO L138 Inliner]: procedures = 119, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 170 [2023-11-29 02:59:06,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:59:06,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:59:06,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:59:06,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:59:06,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:06" (1/1) ... [2023-11-29 02:59:06,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:06" (1/1) ... [2023-11-29 02:59:06,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:06" (1/1) ... [2023-11-29 02:59:06,118 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 15 writes are split as follows [0, 15]. [2023-11-29 02:59:06,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:06" (1/1) ... [2023-11-29 02:59:06,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:06" (1/1) ... [2023-11-29 02:59:06,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:06" (1/1) ... [2023-11-29 02:59:06,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:06" (1/1) ... [2023-11-29 02:59:06,133 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:06" (1/1) ... [2023-11-29 02:59:06,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:06" (1/1) ... [2023-11-29 02:59:06,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:59:06,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:59:06,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:59:06,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:59:06,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:06" (1/1) ... [2023-11-29 02:59:06,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:59:06,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:59:06,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:59:06,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:59:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 02:59:06,190 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 02:59:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 02:59:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 02:59:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 02:59:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 02:59:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:59:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:59:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 02:59:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 02:59:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:59:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:59:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:59:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:59:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 02:59:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:59:06,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:59:06,291 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:59:06,293 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:59:06,649 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:59:06,710 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:59:06,710 INFO L309 CfgBuilder]: Removed 17 assume(true) statements. [2023-11-29 02:59:06,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:59:06 BoogieIcfgContainer [2023-11-29 02:59:06,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:59:06,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:59:06,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:59:06,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:59:06,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:59:05" (1/3) ... [2023-11-29 02:59:06,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6522af73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:59:06, skipping insertion in model container [2023-11-29 02:59:06,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:06" (2/3) ... [2023-11-29 02:59:06,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6522af73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:59:06, skipping insertion in model container [2023-11-29 02:59:06,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:59:06" (3/3) ... [2023-11-29 02:59:06,735 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2023-11-29 02:59:06,754 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:59:06,755 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 74 error locations. [2023-11-29 02:59:06,806 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:59:06,813 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@5b8b14ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:59:06,814 INFO L358 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2023-11-29 02:59:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 76 states have (on average 2.3815789473684212) internal successors, (181), 150 states have internal predecessors, (181), 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) [2023-11-29 02:59:06,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 02:59:06,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:06,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 02:59:06,825 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:06,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:06,831 INFO L85 PathProgramCache]: Analyzing trace with hash 11669, now seen corresponding path program 1 times [2023-11-29 02:59:06,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:06,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100137225] [2023-11-29 02:59:06,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:06,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:07,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:07,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:07,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100137225] [2023-11-29 02:59:07,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100137225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:07,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:07,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:59:07,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821795439] [2023-11-29 02:59:07,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:07,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:59:07,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:07,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:59:07,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:07,059 INFO L87 Difference]: Start difference. First operand has 159 states, 76 states have (on average 2.3815789473684212) internal successors, (181), 150 states have internal predecessors, (181), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-29 02:59:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:07,254 INFO L93 Difference]: Finished difference Result 175 states and 188 transitions. [2023-11-29 02:59:07,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:59:07,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-29 02:59:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:07,265 INFO L225 Difference]: With dead ends: 175 [2023-11-29 02:59:07,265 INFO L226 Difference]: Without dead ends: 174 [2023-11-29 02:59:07,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:07,270 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 130 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:07,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 99 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:59:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-29 02:59:07,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2023-11-29 02:59:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 72 states have (on average 2.1805555555555554) internal successors, (157), 148 states have internal predecessors, (157), 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) [2023-11-29 02:59:07,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2023-11-29 02:59:07,313 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 2 [2023-11-29 02:59:07,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:07,313 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2023-11-29 02:59:07,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-29 02:59:07,313 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2023-11-29 02:59:07,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 02:59:07,314 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:07,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 02:59:07,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:59:07,314 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:07,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:07,315 INFO L85 PathProgramCache]: Analyzing trace with hash 11670, now seen corresponding path program 1 times [2023-11-29 02:59:07,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:07,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989403338] [2023-11-29 02:59:07,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:07,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:07,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:07,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989403338] [2023-11-29 02:59:07,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989403338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:07,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:07,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:59:07,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043775532] [2023-11-29 02:59:07,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:07,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:59:07,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:07,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:59:07,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:07,404 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-29 02:59:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:07,532 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2023-11-29 02:59:07,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:59:07,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-29 02:59:07,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:07,534 INFO L225 Difference]: With dead ends: 146 [2023-11-29 02:59:07,534 INFO L226 Difference]: Without dead ends: 146 [2023-11-29 02:59:07,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:07,536 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 140 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:07,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 79 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:59:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-29 02:59:07,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2023-11-29 02:59:07,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 72 states have (on average 2.111111111111111) internal successors, (152), 144 states have internal predecessors, (152), 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) [2023-11-29 02:59:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2023-11-29 02:59:07,548 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 2 [2023-11-29 02:59:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:07,549 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2023-11-29 02:59:07,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-29 02:59:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2023-11-29 02:59:07,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 02:59:07,549 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:07,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:59:07,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:59:07,550 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:07,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:07,551 INFO L85 PathProgramCache]: Analyzing trace with hash 347626676, now seen corresponding path program 1 times [2023-11-29 02:59:07,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:07,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44975380] [2023-11-29 02:59:07,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:07,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:07,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:07,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44975380] [2023-11-29 02:59:07,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44975380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:07,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:07,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:59:07,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868228946] [2023-11-29 02:59:07,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:07,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:59:07,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:07,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:59:07,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:07,634 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-29 02:59:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:07,754 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2023-11-29 02:59:07,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:59:07,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2023-11-29 02:59:07,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:07,756 INFO L225 Difference]: With dead ends: 142 [2023-11-29 02:59:07,756 INFO L226 Difference]: Without dead ends: 142 [2023-11-29 02:59:07,757 INFO L412 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 [2023-11-29 02:59:07,758 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 116 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:07,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 90 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:59:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-29 02:59:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2023-11-29 02:59:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 73 states have (on average 2.0136986301369864) internal successors, (147), 138 states have internal predecessors, (147), 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) [2023-11-29 02:59:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2023-11-29 02:59:07,768 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 5 [2023-11-29 02:59:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:07,769 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2023-11-29 02:59:07,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-29 02:59:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2023-11-29 02:59:07,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 02:59:07,770 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:07,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:59:07,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:59:07,770 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:07,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:07,771 INFO L85 PathProgramCache]: Analyzing trace with hash 347626677, now seen corresponding path program 1 times [2023-11-29 02:59:07,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:07,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699773306] [2023-11-29 02:59:07,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:07,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:07,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:07,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699773306] [2023-11-29 02:59:07,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699773306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:07,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:07,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:59:07,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610695997] [2023-11-29 02:59:07,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:07,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:59:07,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:07,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:59:07,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:07,883 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-29 02:59:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:08,018 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2023-11-29 02:59:08,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:59:08,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2023-11-29 02:59:08,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:08,020 INFO L225 Difference]: With dead ends: 154 [2023-11-29 02:59:08,020 INFO L226 Difference]: Without dead ends: 154 [2023-11-29 02:59:08,020 INFO L412 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 [2023-11-29 02:59:08,021 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 113 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:08,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 98 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:59:08,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-29 02:59:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 142. [2023-11-29 02:59:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 78 states have (on average 1.9102564102564104) internal successors, (149), 140 states have internal predecessors, (149), 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) [2023-11-29 02:59:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2023-11-29 02:59:08,031 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 5 [2023-11-29 02:59:08,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:08,031 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2023-11-29 02:59:08,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-29 02:59:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2023-11-29 02:59:08,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 02:59:08,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:08,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:08,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:59:08,033 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:08,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:08,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1334688605, now seen corresponding path program 1 times [2023-11-29 02:59:08,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:08,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797829810] [2023-11-29 02:59:08,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:08,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:08,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797829810] [2023-11-29 02:59:08,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797829810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:08,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:08,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:59:08,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689124441] [2023-11-29 02:59:08,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:08,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:59:08,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:08,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:59:08,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:08,178 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-29 02:59:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:08,346 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2023-11-29 02:59:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:59:08,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2023-11-29 02:59:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:08,347 INFO L225 Difference]: With dead ends: 140 [2023-11-29 02:59:08,347 INFO L226 Difference]: Without dead ends: 140 [2023-11-29 02:59:08,348 INFO L412 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 [2023-11-29 02:59:08,349 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 178 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:08,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 77 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:59:08,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-29 02:59:08,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129. [2023-11-29 02:59:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 80 states have (on average 1.725) internal successors, (138), 127 states have internal predecessors, (138), 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) [2023-11-29 02:59:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2023-11-29 02:59:08,357 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 10 [2023-11-29 02:59:08,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:08,358 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2023-11-29 02:59:08,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-29 02:59:08,358 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2023-11-29 02:59:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 02:59:08,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:08,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:08,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:59:08,359 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:08,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:08,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1334688606, now seen corresponding path program 1 times [2023-11-29 02:59:08,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:08,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12861461] [2023-11-29 02:59:08,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:08,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:08,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:08,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12861461] [2023-11-29 02:59:08,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12861461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:08,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:08,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:59:08,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79691862] [2023-11-29 02:59:08,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:08,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:59:08,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:08,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:59:08,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:08,536 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-29 02:59:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:08,740 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2023-11-29 02:59:08,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:59:08,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2023-11-29 02:59:08,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:08,742 INFO L225 Difference]: With dead ends: 163 [2023-11-29 02:59:08,742 INFO L226 Difference]: Without dead ends: 163 [2023-11-29 02:59:08,743 INFO L412 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 [2023-11-29 02:59:08,744 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 152 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:08,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 110 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:59:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-29 02:59:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 137. [2023-11-29 02:59:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 89 states have (on average 1.6741573033707866) internal successors, (149), 135 states have internal predecessors, (149), 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) [2023-11-29 02:59:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2023-11-29 02:59:08,752 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 10 [2023-11-29 02:59:08,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:08,752 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2023-11-29 02:59:08,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-29 02:59:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2023-11-29 02:59:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 02:59:08,753 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:08,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:08,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:59:08,753 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:08,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:08,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1559181362, now seen corresponding path program 1 times [2023-11-29 02:59:08,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:08,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008134829] [2023-11-29 02:59:08,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:08,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:08,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:08,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008134829] [2023-11-29 02:59:08,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008134829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:08,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:08,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:59:08,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377657146] [2023-11-29 02:59:08,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:08,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:59:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:08,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:59:08,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:59:08,893 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2023-11-29 02:59:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:09,050 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2023-11-29 02:59:09,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:59:09,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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 [2023-11-29 02:59:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:09,052 INFO L225 Difference]: With dead ends: 136 [2023-11-29 02:59:09,052 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 02:59:09,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:59:09,054 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 6 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:09,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 310 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:59:09,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 02:59:09,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-11-29 02:59:09,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 89 states have (on average 1.651685393258427) internal successors, (147), 134 states have internal predecessors, (147), 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) [2023-11-29 02:59:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2023-11-29 02:59:09,060 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 12 [2023-11-29 02:59:09,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:09,060 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2023-11-29 02:59:09,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2023-11-29 02:59:09,060 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2023-11-29 02:59:09,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 02:59:09,061 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:09,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:09,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:59:09,061 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:09,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1559181361, now seen corresponding path program 1 times [2023-11-29 02:59:09,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:09,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390449411] [2023-11-29 02:59:09,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:09,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:09,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:09,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390449411] [2023-11-29 02:59:09,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390449411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:09,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:09,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:59:09,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916980474] [2023-11-29 02:59:09,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:09,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:59:09,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:09,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:59:09,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:59:09,291 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2023-11-29 02:59:09,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:09,461 INFO L93 Difference]: Finished difference Result 135 states and 152 transitions. [2023-11-29 02:59:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:59:09,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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 [2023-11-29 02:59:09,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:09,462 INFO L225 Difference]: With dead ends: 135 [2023-11-29 02:59:09,463 INFO L226 Difference]: Without dead ends: 135 [2023-11-29 02:59:09,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:59:09,464 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 3 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:09,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 299 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:59:09,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-29 02:59:09,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-11-29 02:59:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 133 states have internal predecessors, (145), 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) [2023-11-29 02:59:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2023-11-29 02:59:09,469 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 12 [2023-11-29 02:59:09,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:09,469 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2023-11-29 02:59:09,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2023-11-29 02:59:09,470 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2023-11-29 02:59:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 02:59:09,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:09,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:09,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:59:09,476 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:09,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:09,477 INFO L85 PathProgramCache]: Analyzing trace with hash 342184981, now seen corresponding path program 1 times [2023-11-29 02:59:09,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:09,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489421308] [2023-11-29 02:59:09,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:09,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:09,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:09,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489421308] [2023-11-29 02:59:09,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489421308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:09,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:09,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:59:09,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350100667] [2023-11-29 02:59:09,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:09,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:59:09,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:09,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:59:09,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:59:09,554 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2023-11-29 02:59:09,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:09,739 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2023-11-29 02:59:09,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:59:09,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 14 [2023-11-29 02:59:09,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:09,743 INFO L225 Difference]: With dead ends: 169 [2023-11-29 02:59:09,744 INFO L226 Difference]: Without dead ends: 169 [2023-11-29 02:59:09,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:59:09,745 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 242 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:09,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 142 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:59:09,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-11-29 02:59:09,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 137. [2023-11-29 02:59:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.5978260869565217) internal successors, (147), 135 states have internal predecessors, (147), 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) [2023-11-29 02:59:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 153 transitions. [2023-11-29 02:59:09,751 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 153 transitions. Word has length 14 [2023-11-29 02:59:09,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:09,751 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 153 transitions. [2023-11-29 02:59:09,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2023-11-29 02:59:09,751 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 153 transitions. [2023-11-29 02:59:09,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 02:59:09,752 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:09,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:09,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:59:09,752 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:09,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash 570592693, now seen corresponding path program 1 times [2023-11-29 02:59:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:09,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315057601] [2023-11-29 02:59:09,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:09,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:09,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:09,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315057601] [2023-11-29 02:59:09,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315057601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:09,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:09,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:59:09,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425414540] [2023-11-29 02:59:09,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:09,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:59:09,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:09,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:59:09,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:59:09,999 INFO L87 Difference]: Start difference. First operand 137 states and 153 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:10,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:10,370 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2023-11-29 02:59:10,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:59:10,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 02:59:10,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:10,372 INFO L225 Difference]: With dead ends: 136 [2023-11-29 02:59:10,372 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 02:59:10,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:59:10,373 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 149 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:10,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 221 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:59:10,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 02:59:10,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-11-29 02:59:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 92 states have (on average 1.5869565217391304) internal successors, (146), 134 states have internal predecessors, (146), 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) [2023-11-29 02:59:10,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2023-11-29 02:59:10,377 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 14 [2023-11-29 02:59:10,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:10,378 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2023-11-29 02:59:10,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:10,378 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2023-11-29 02:59:10,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 02:59:10,379 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:10,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:10,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:59:10,379 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:10,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:10,379 INFO L85 PathProgramCache]: Analyzing trace with hash 570592694, now seen corresponding path program 1 times [2023-11-29 02:59:10,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:10,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497384749] [2023-11-29 02:59:10,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:10,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:10,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:10,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497384749] [2023-11-29 02:59:10,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497384749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:10,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:10,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:59:10,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172907294] [2023-11-29 02:59:10,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:10,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:59:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:10,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:59:10,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:59:10,726 INFO L87 Difference]: Start difference. First operand 136 states and 152 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:11,228 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2023-11-29 02:59:11,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 02:59:11,229 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 02:59:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:11,230 INFO L225 Difference]: With dead ends: 148 [2023-11-29 02:59:11,230 INFO L226 Difference]: Without dead ends: 148 [2023-11-29 02:59:11,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-29 02:59:11,231 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 183 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:11,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 288 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:59:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-29 02:59:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2023-11-29 02:59:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 100 states have (on average 1.51) internal successors, (151), 136 states have internal predecessors, (151), 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) [2023-11-29 02:59:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 157 transitions. [2023-11-29 02:59:11,236 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 157 transitions. Word has length 14 [2023-11-29 02:59:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:11,236 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 157 transitions. [2023-11-29 02:59:11,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 157 transitions. [2023-11-29 02:59:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 02:59:11,237 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:11,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:11,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:59:11,238 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:11,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:11,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1295017745, now seen corresponding path program 1 times [2023-11-29 02:59:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:11,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516065513] [2023-11-29 02:59:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:11,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:11,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:11,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516065513] [2023-11-29 02:59:11,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516065513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:11,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:11,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:59:11,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450808556] [2023-11-29 02:59:11,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:11,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:59:11,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:11,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:59:11,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:59:11,430 INFO L87 Difference]: Start difference. First operand 138 states and 157 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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) [2023-11-29 02:59:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:11,720 INFO L93 Difference]: Finished difference Result 188 states and 214 transitions. [2023-11-29 02:59:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:59:11,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 17 [2023-11-29 02:59:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:11,722 INFO L225 Difference]: With dead ends: 188 [2023-11-29 02:59:11,722 INFO L226 Difference]: Without dead ends: 188 [2023-11-29 02:59:11,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:59:11,723 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 356 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:11,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 249 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:59:11,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-29 02:59:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 145. [2023-11-29 02:59:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 107 states have (on average 1.485981308411215) internal successors, (159), 143 states have internal predecessors, (159), 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) [2023-11-29 02:59:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2023-11-29 02:59:11,728 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 17 [2023-11-29 02:59:11,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:11,729 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2023-11-29 02:59:11,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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) [2023-11-29 02:59:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2023-11-29 02:59:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 02:59:11,729 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:11,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:11,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:59:11,730 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:11,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:11,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1834740430, now seen corresponding path program 1 times [2023-11-29 02:59:11,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:11,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405336314] [2023-11-29 02:59:11,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:11,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:11,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:11,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405336314] [2023-11-29 02:59:11,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405336314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:11,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:11,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:59:11,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643900286] [2023-11-29 02:59:11,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:11,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:59:11,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:11,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:59:11,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:59:11,866 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2023-11-29 02:59:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:11,996 INFO L93 Difference]: Finished difference Result 144 states and 164 transitions. [2023-11-29 02:59:11,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:59:11,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2023-11-29 02:59:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:11,997 INFO L225 Difference]: With dead ends: 144 [2023-11-29 02:59:11,997 INFO L226 Difference]: Without dead ends: 144 [2023-11-29 02:59:11,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:59:11,998 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 3 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:11,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 286 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:59:11,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-29 02:59:12,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2023-11-29 02:59:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 142 states have internal predecessors, (158), 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) [2023-11-29 02:59:12,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 164 transitions. [2023-11-29 02:59:12,004 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 164 transitions. Word has length 19 [2023-11-29 02:59:12,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:12,004 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 164 transitions. [2023-11-29 02:59:12,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2023-11-29 02:59:12,004 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 164 transitions. [2023-11-29 02:59:12,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 02:59:12,005 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:12,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:12,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:59:12,006 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:12,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:12,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1834740429, now seen corresponding path program 1 times [2023-11-29 02:59:12,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:12,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539037725] [2023-11-29 02:59:12,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:12,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:12,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:12,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539037725] [2023-11-29 02:59:12,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539037725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:12,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:12,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:59:12,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079312671] [2023-11-29 02:59:12,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:12,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:59:12,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:12,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:59:12,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:59:12,248 INFO L87 Difference]: Start difference. First operand 144 states and 164 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2023-11-29 02:59:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:12,408 INFO L93 Difference]: Finished difference Result 143 states and 163 transitions. [2023-11-29 02:59:12,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:59:12,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2023-11-29 02:59:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:12,410 INFO L225 Difference]: With dead ends: 143 [2023-11-29 02:59:12,410 INFO L226 Difference]: Without dead ends: 143 [2023-11-29 02:59:12,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:59:12,411 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:12,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 280 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:59:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-29 02:59:12,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2023-11-29 02:59:12,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 141 states have internal predecessors, (157), 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) [2023-11-29 02:59:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 163 transitions. [2023-11-29 02:59:12,417 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 163 transitions. Word has length 19 [2023-11-29 02:59:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:12,418 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 163 transitions. [2023-11-29 02:59:12,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2023-11-29 02:59:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 163 transitions. [2023-11-29 02:59:12,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 02:59:12,419 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:12,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:12,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:59:12,420 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:12,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:12,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1809377916, now seen corresponding path program 1 times [2023-11-29 02:59:12,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:12,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093752433] [2023-11-29 02:59:12,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:12,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:12,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:12,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093752433] [2023-11-29 02:59:12,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093752433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:12,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:12,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:59:12,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688031754] [2023-11-29 02:59:12,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:12,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:59:12,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:12,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:59:12,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:12,528 INFO L87 Difference]: Start difference. First operand 143 states and 163 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2023-11-29 02:59:12,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:12,627 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2023-11-29 02:59:12,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:59:12,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 21 [2023-11-29 02:59:12,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:12,628 INFO L225 Difference]: With dead ends: 142 [2023-11-29 02:59:12,628 INFO L226 Difference]: Without dead ends: 142 [2023-11-29 02:59:12,628 INFO L412 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 [2023-11-29 02:59:12,629 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 18 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:12,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 212 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:59:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-29 02:59:12,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-11-29 02:59:12,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 107 states have (on average 1.4485981308411215) internal successors, (155), 140 states have internal predecessors, (155), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2023-11-29 02:59:12,634 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 21 [2023-11-29 02:59:12,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:12,634 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2023-11-29 02:59:12,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2023-11-29 02:59:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2023-11-29 02:59:12,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 02:59:12,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:12,636 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:12,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:59:12,636 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:12,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash 596696695, now seen corresponding path program 1 times [2023-11-29 02:59:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:12,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465988506] [2023-11-29 02:59:12,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:12,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:12,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:12,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465988506] [2023-11-29 02:59:12,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465988506] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:59:12,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335440670] [2023-11-29 02:59:12,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:12,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:59:12,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:59:12,857 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:59:12,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 02:59:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:12,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 02:59:13,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:59:13,046 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 [2023-11-29 02:59:13,092 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 02:59:13,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 02:59:13,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:59:13,171 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 19 treesize of output 18 [2023-11-29 02:59:13,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 02:59:13,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:13,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2023-11-29 02:59:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:13,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:59:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:13,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335440670] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:59:13,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:59:13,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 16 [2023-11-29 02:59:13,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80981716] [2023-11-29 02:59:13,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:59:13,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 02:59:13,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:13,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 02:59:13,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:59:13,643 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 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) [2023-11-29 02:59:14,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:14,795 INFO L93 Difference]: Finished difference Result 216 states and 238 transitions. [2023-11-29 02:59:14,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 02:59:14,796 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 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 21 [2023-11-29 02:59:14,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:14,797 INFO L225 Difference]: With dead ends: 216 [2023-11-29 02:59:14,797 INFO L226 Difference]: Without dead ends: 216 [2023-11-29 02:59:14,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=308, Invalid=952, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 02:59:14,798 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 575 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:14,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 248 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 02:59:14,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-11-29 02:59:14,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 169. [2023-11-29 02:59:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 134 states have (on average 1.4477611940298507) internal successors, (194), 167 states have internal predecessors, (194), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 199 transitions. [2023-11-29 02:59:14,803 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 199 transitions. Word has length 21 [2023-11-29 02:59:14,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:14,804 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 199 transitions. [2023-11-29 02:59:14,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 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) [2023-11-29 02:59:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 199 transitions. [2023-11-29 02:59:14,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 02:59:14,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:14,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:14,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:59:15,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 02:59:15,009 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:15,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:15,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2046264024, now seen corresponding path program 1 times [2023-11-29 02:59:15,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:15,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639756737] [2023-11-29 02:59:15,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:15,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:15,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:15,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639756737] [2023-11-29 02:59:15,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639756737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:15,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:15,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:59:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317000] [2023-11-29 02:59:15,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:15,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:59:15,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:15,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:59:15,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:59:15,240 INFO L87 Difference]: Start difference. First operand 169 states and 199 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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) [2023-11-29 02:59:15,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:15,414 INFO L93 Difference]: Finished difference Result 168 states and 198 transitions. [2023-11-29 02:59:15,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:59:15,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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 21 [2023-11-29 02:59:15,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:15,415 INFO L225 Difference]: With dead ends: 168 [2023-11-29 02:59:15,415 INFO L226 Difference]: Without dead ends: 168 [2023-11-29 02:59:15,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:59:15,416 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 46 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:15,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 178 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:59:15,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-29 02:59:15,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2023-11-29 02:59:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 166 states have internal predecessors, (193), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 198 transitions. [2023-11-29 02:59:15,420 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 198 transitions. Word has length 21 [2023-11-29 02:59:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:15,420 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 198 transitions. [2023-11-29 02:59:15,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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) [2023-11-29 02:59:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 198 transitions. [2023-11-29 02:59:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 02:59:15,421 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:15,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:15,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:59:15,422 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:15,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:15,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2046264025, now seen corresponding path program 1 times [2023-11-29 02:59:15,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:15,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075622250] [2023-11-29 02:59:15,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:15,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:15,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:15,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075622250] [2023-11-29 02:59:15,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075622250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:15,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:15,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:59:15,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978049421] [2023-11-29 02:59:15,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:15,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:59:15,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:15,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:59:15,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:59:15,742 INFO L87 Difference]: Start difference. First operand 168 states and 198 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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) [2023-11-29 02:59:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:16,023 INFO L93 Difference]: Finished difference Result 164 states and 194 transitions. [2023-11-29 02:59:16,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:59:16,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 21 [2023-11-29 02:59:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:16,026 INFO L225 Difference]: With dead ends: 164 [2023-11-29 02:59:16,026 INFO L226 Difference]: Without dead ends: 164 [2023-11-29 02:59:16,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:59:16,027 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 55 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:16,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 319 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:59:16,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-29 02:59:16,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2023-11-29 02:59:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 120 states have (on average 1.4083333333333334) internal successors, (169), 145 states have internal predecessors, (169), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 174 transitions. [2023-11-29 02:59:16,031 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 174 transitions. Word has length 21 [2023-11-29 02:59:16,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:16,031 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 174 transitions. [2023-11-29 02:59:16,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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) [2023-11-29 02:59:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 174 transitions. [2023-11-29 02:59:16,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 02:59:16,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:16,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:16,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 02:59:16,033 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:16,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:16,034 INFO L85 PathProgramCache]: Analyzing trace with hash 944101404, now seen corresponding path program 1 times [2023-11-29 02:59:16,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:16,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031165720] [2023-11-29 02:59:16,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:16,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:16,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:16,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031165720] [2023-11-29 02:59:16,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031165720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:16,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:16,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:59:16,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795564722] [2023-11-29 02:59:16,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:16,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:59:16,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:16,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:59:16,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:59:16,086 INFO L87 Difference]: Start difference. First operand 147 states and 174 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2023-11-29 02:59:16,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:16,210 INFO L93 Difference]: Finished difference Result 144 states and 169 transitions. [2023-11-29 02:59:16,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:59:16,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 [2023-11-29 02:59:16,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:16,211 INFO L225 Difference]: With dead ends: 144 [2023-11-29 02:59:16,211 INFO L226 Difference]: Without dead ends: 144 [2023-11-29 02:59:16,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:59:16,212 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 16 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:16,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 238 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:59:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-29 02:59:16,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2023-11-29 02:59:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 142 states have internal predecessors, (164), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2023-11-29 02:59:16,217 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 23 [2023-11-29 02:59:16,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:16,217 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2023-11-29 02:59:16,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2023-11-29 02:59:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2023-11-29 02:59:16,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 02:59:16,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:16,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:16,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 02:59:16,218 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:16,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:16,219 INFO L85 PathProgramCache]: Analyzing trace with hash 603082545, now seen corresponding path program 1 times [2023-11-29 02:59:16,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:16,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116490159] [2023-11-29 02:59:16,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:16,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:16,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:16,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116490159] [2023-11-29 02:59:16,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116490159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:16,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:16,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:59:16,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939017510] [2023-11-29 02:59:16,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:16,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:59:16,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:16,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:59:16,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:16,373 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) [2023-11-29 02:59:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:16,492 INFO L93 Difference]: Finished difference Result 144 states and 168 transitions. [2023-11-29 02:59:16,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:59:16,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 24 [2023-11-29 02:59:16,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:16,494 INFO L225 Difference]: With dead ends: 144 [2023-11-29 02:59:16,494 INFO L226 Difference]: Without dead ends: 144 [2023-11-29 02:59:16,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:59:16,495 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 10 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:16,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 184 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:59:16,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-29 02:59:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2023-11-29 02:59:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 117 states have (on average 1.393162393162393) internal successors, (163), 141 states have internal predecessors, (163), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2023-11-29 02:59:16,501 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 24 [2023-11-29 02:59:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:16,501 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2023-11-29 02:59:16,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) [2023-11-29 02:59:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2023-11-29 02:59:16,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 02:59:16,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:16,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:16,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 02:59:16,503 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:16,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:16,503 INFO L85 PathProgramCache]: Analyzing trace with hash -316730170, now seen corresponding path program 1 times [2023-11-29 02:59:16,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:16,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388030796] [2023-11-29 02:59:16,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:16,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:16,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:16,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388030796] [2023-11-29 02:59:16,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388030796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:16,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:16,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 02:59:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722605546] [2023-11-29 02:59:16,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:16,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:59:16,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:16,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:59:16,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:59:16,752 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 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) [2023-11-29 02:59:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:17,115 INFO L93 Difference]: Finished difference Result 190 states and 214 transitions. [2023-11-29 02:59:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 02:59:17,117 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 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 26 [2023-11-29 02:59:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:17,118 INFO L225 Difference]: With dead ends: 190 [2023-11-29 02:59:17,118 INFO L226 Difference]: Without dead ends: 190 [2023-11-29 02:59:17,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2023-11-29 02:59:17,119 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 195 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:17,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 248 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:59:17,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-11-29 02:59:17,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 150. [2023-11-29 02:59:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 124 states have (on average 1.3709677419354838) internal successors, (170), 148 states have internal predecessors, (170), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2023-11-29 02:59:17,125 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 26 [2023-11-29 02:59:17,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:17,125 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2023-11-29 02:59:17,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 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) [2023-11-29 02:59:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2023-11-29 02:59:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 02:59:17,126 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:17,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:17,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 02:59:17,126 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:17,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:17,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1208357173, now seen corresponding path program 1 times [2023-11-29 02:59:17,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:17,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179960638] [2023-11-29 02:59:17,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:17,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:59:17,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:17,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179960638] [2023-11-29 02:59:17,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179960638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:17,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:17,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:59:17,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403243470] [2023-11-29 02:59:17,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:17,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:59:17,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:17,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:59:17,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:17,168 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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) [2023-11-29 02:59:17,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:17,225 INFO L93 Difference]: Finished difference Result 152 states and 173 transitions. [2023-11-29 02:59:17,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:59:17,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2023-11-29 02:59:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:17,229 INFO L225 Difference]: With dead ends: 152 [2023-11-29 02:59:17,229 INFO L226 Difference]: Without dead ends: 152 [2023-11-29 02:59:17,229 INFO L412 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 [2023-11-29 02:59:17,230 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 49 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:17,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 93 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:59:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-29 02:59:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2023-11-29 02:59:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 126 states have (on average 1.3412698412698412) internal successors, (169), 150 states have internal predecessors, (169), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 173 transitions. [2023-11-29 02:59:17,235 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 173 transitions. Word has length 26 [2023-11-29 02:59:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:17,235 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 173 transitions. [2023-11-29 02:59:17,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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) [2023-11-29 02:59:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 173 transitions. [2023-11-29 02:59:17,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 02:59:17,236 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:17,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:17,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 02:59:17,236 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:17,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:17,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1590083352, now seen corresponding path program 1 times [2023-11-29 02:59:17,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:17,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282927445] [2023-11-29 02:59:17,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:17,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:17,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:17,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282927445] [2023-11-29 02:59:17,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282927445] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:59:17,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976502437] [2023-11-29 02:59:17,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:17,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:59:17,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:59:17,371 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:59:17,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 02:59:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:17,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:59:17,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:59:17,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 02:59:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:59:17,564 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:59:17,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976502437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:17,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:59:17,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2023-11-29 02:59:17,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912890326] [2023-11-29 02:59:17,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:17,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:59:17,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:17,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:59:17,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:59:17,566 INFO L87 Difference]: Start difference. First operand 152 states and 173 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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) [2023-11-29 02:59:17,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:17,655 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2023-11-29 02:59:17,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:59:17,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2023-11-29 02:59:17,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:17,656 INFO L225 Difference]: With dead ends: 147 [2023-11-29 02:59:17,656 INFO L226 Difference]: Without dead ends: 147 [2023-11-29 02:59:17,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:59:17,657 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:17,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 210 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:59:17,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-29 02:59:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2023-11-29 02:59:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 144 states have internal predecessors, (160), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2023-11-29 02:59:17,662 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 28 [2023-11-29 02:59:17,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:17,662 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2023-11-29 02:59:17,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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) [2023-11-29 02:59:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2023-11-29 02:59:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 02:59:17,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:17,663 INFO L195 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] [2023-11-29 02:59:17,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 02:59:17,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:59:17,863 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:17,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:17,864 INFO L85 PathProgramCache]: Analyzing trace with hash 434102536, now seen corresponding path program 1 times [2023-11-29 02:59:17,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:17,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440386964] [2023-11-29 02:59:17,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:17,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:18,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:18,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440386964] [2023-11-29 02:59:18,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440386964] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:59:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940810021] [2023-11-29 02:59:18,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:18,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:59:18,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:59:18,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:59:18,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 02:59:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:18,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 02:59:18,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:59:18,182 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 [2023-11-29 02:59:18,186 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 [2023-11-29 02:59:18,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-29 02:59:18,201 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 21 treesize of output 20 [2023-11-29 02:59:18,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:18,229 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2023-11-29 02:59:18,236 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 27 treesize of output 11 [2023-11-29 02:59:18,350 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 15 treesize of output 7 [2023-11-29 02:59:18,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:18,357 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 24 treesize of output 10 [2023-11-29 02:59:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:59:18,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:59:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:59:18,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940810021] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:59:18,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:59:18,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 8 [2023-11-29 02:59:18,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73577370] [2023-11-29 02:59:18,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:59:18,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:59:18,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:18,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:59:18,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:59:18,491 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:18,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:18,911 INFO L93 Difference]: Finished difference Result 205 states and 223 transitions. [2023-11-29 02:59:18,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 02:59:18,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-29 02:59:18,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:18,912 INFO L225 Difference]: With dead ends: 205 [2023-11-29 02:59:18,912 INFO L226 Difference]: Without dead ends: 205 [2023-11-29 02:59:18,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:59:18,913 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 132 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:18,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 243 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:59:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-29 02:59:18,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 144. [2023-11-29 02:59:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 118 states have (on average 1.305084745762712) internal successors, (154), 142 states have internal predecessors, (154), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2023-11-29 02:59:18,918 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 29 [2023-11-29 02:59:18,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:18,918 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2023-11-29 02:59:18,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2023-11-29 02:59:18,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 02:59:18,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:18,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:18,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 02:59:19,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:59:19,119 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:19,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:19,120 INFO L85 PathProgramCache]: Analyzing trace with hash 572276420, now seen corresponding path program 1 times [2023-11-29 02:59:19,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:19,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463021807] [2023-11-29 02:59:19,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:19,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:59:19,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:19,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463021807] [2023-11-29 02:59:19,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463021807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:19,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:19,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:59:19,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803235832] [2023-11-29 02:59:19,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:19,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:59:19,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:19,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:59:19,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:19,155 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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) [2023-11-29 02:59:19,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:19,208 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2023-11-29 02:59:19,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:59:19,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 30 [2023-11-29 02:59:19,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:19,209 INFO L225 Difference]: With dead ends: 143 [2023-11-29 02:59:19,209 INFO L226 Difference]: Without dead ends: 143 [2023-11-29 02:59:19,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:19,210 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 66 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:19,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 62 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:59:19,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-29 02:59:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2023-11-29 02:59:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 118 states have (on average 1.2881355932203389) internal successors, (152), 141 states have internal predecessors, (152), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2023-11-29 02:59:19,215 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 30 [2023-11-29 02:59:19,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:19,215 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2023-11-29 02:59:19,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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) [2023-11-29 02:59:19,215 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2023-11-29 02:59:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 02:59:19,216 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:19,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:19,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 02:59:19,216 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:19,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:19,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1313646286, now seen corresponding path program 1 times [2023-11-29 02:59:19,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:19,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287415168] [2023-11-29 02:59:19,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:19,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:19,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:19,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287415168] [2023-11-29 02:59:19,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287415168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:19,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:19,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 02:59:19,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639714935] [2023-11-29 02:59:19,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:19,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 02:59:19,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:19,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:59:19,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:59:19,520 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) [2023-11-29 02:59:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:19,830 INFO L93 Difference]: Finished difference Result 177 states and 191 transitions. [2023-11-29 02:59:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:59:19,831 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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 32 [2023-11-29 02:59:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:19,831 INFO L225 Difference]: With dead ends: 177 [2023-11-29 02:59:19,832 INFO L226 Difference]: Without dead ends: 177 [2023-11-29 02:59:19,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:59:19,832 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 226 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:19,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 334 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:59:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-29 02:59:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2023-11-29 02:59:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 133 states have internal predecessors, (144), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2023-11-29 02:59:19,837 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 32 [2023-11-29 02:59:19,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:19,838 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2023-11-29 02:59:19,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) [2023-11-29 02:59:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2023-11-29 02:59:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 02:59:19,839 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:19,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:19,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 02:59:19,839 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:19,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:19,840 INFO L85 PathProgramCache]: Analyzing trace with hash 201836775, now seen corresponding path program 1 times [2023-11-29 02:59:19,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:19,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864613686] [2023-11-29 02:59:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:19,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:59:20,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:20,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864613686] [2023-11-29 02:59:20,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864613686] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:59:20,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393513586] [2023-11-29 02:59:20,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:20,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:59:20,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:59:20,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:59:20,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 02:59:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:20,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 02:59:20,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:59:20,274 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 02:59:20,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 20 treesize of output 27 [2023-11-29 02:59:20,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 16 treesize of output 29 [2023-11-29 02:59:20,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:59:20,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:59:20,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:59:20,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393513586] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:59:20,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:59:20,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-11-29 02:59:20,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886112168] [2023-11-29 02:59:20,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:59:20,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:59:20,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:20,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:59:20,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:59:20,938 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 14 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 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) [2023-11-29 02:59:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:21,366 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2023-11-29 02:59:21,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:59:21,367 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 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 [2023-11-29 02:59:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:21,367 INFO L225 Difference]: With dead ends: 144 [2023-11-29 02:59:21,367 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 02:59:21,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-11-29 02:59:21,368 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 34 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:21,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 304 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:59:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 02:59:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-29 02:59:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 97 states have (on average 1.3298969072164948) internal successors, (129), 119 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2023-11-29 02:59:21,371 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 32 [2023-11-29 02:59:21,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:21,371 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2023-11-29 02:59:21,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 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) [2023-11-29 02:59:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2023-11-29 02:59:21,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 02:59:21,371 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:21,372 INFO L195 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] [2023-11-29 02:59:21,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 02:59:21,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 02:59:21,572 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:21,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:21,573 INFO L85 PathProgramCache]: Analyzing trace with hash -221680808, now seen corresponding path program 1 times [2023-11-29 02:59:21,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:21,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568287562] [2023-11-29 02:59:21,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:21,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:22,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:22,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568287562] [2023-11-29 02:59:22,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568287562] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:59:22,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283610478] [2023-11-29 02:59:22,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:22,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:59:22,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:59:22,160 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:59:22,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 02:59:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:22,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 02:59:22,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:59:22,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:59:22,380 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 [2023-11-29 02:59:22,424 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 02:59:22,425 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 [2023-11-29 02:59:22,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:59:22,459 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 [2023-11-29 02:59:22,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:59:22,544 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:59:22,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 02:59:22,549 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 [2023-11-29 02:59:22,566 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 [2023-11-29 02:59:22,594 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 [2023-11-29 02:59:22,609 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 [2023-11-29 02:59:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:22,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:59:22,726 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1621 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2023-11-29 02:59:22,743 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1621 (Array Int Int))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1621) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2023-11-29 02:59:22,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:22,885 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 38 treesize of output 39 [2023-11-29 02:59:22,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2023-11-29 02:59:22,894 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 29 treesize of output 27 [2023-11-29 02:59:23,179 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:59:23,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:23,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 133 [2023-11-29 02:59:23,206 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 164 treesize of output 152 [2023-11-29 02:59:23,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:59:23,217 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 8 treesize of output 4 [2023-11-29 02:59:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:23,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283610478] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:59:23,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:59:23,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 30 [2023-11-29 02:59:23,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124486400] [2023-11-29 02:59:23,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:59:23,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 02:59:23,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:23,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 02:59:23,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=598, Unknown=34, NotChecked=106, Total=870 [2023-11-29 02:59:23,247 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 30 states have internal predecessors, (88), 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) [2023-11-29 02:59:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:24,905 INFO L93 Difference]: Finished difference Result 197 states and 217 transitions. [2023-11-29 02:59:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 02:59:24,906 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 30 states have internal predecessors, (88), 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 [2023-11-29 02:59:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:24,907 INFO L225 Difference]: With dead ends: 197 [2023-11-29 02:59:24,907 INFO L226 Difference]: Without dead ends: 197 [2023-11-29 02:59:24,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=422, Invalid=1441, Unknown=37, NotChecked=170, Total=2070 [2023-11-29 02:59:24,908 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 575 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 60 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:24,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 451 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 920 Invalid, 17 Unknown, 358 Unchecked, 0.9s Time] [2023-11-29 02:59:24,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-11-29 02:59:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 143. [2023-11-29 02:59:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 119 states have (on average 1.2857142857142858) internal successors, (153), 141 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2023-11-29 02:59:24,913 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 34 [2023-11-29 02:59:24,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:24,913 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2023-11-29 02:59:24,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 30 states have internal predecessors, (88), 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) [2023-11-29 02:59:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2023-11-29 02:59:24,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 02:59:24,914 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:24,914 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:24,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 02:59:25,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-29 02:59:25,115 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:25,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:25,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1863293122, now seen corresponding path program 1 times [2023-11-29 02:59:25,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:25,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25203060] [2023-11-29 02:59:25,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:25,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:25,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:25,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:25,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25203060] [2023-11-29 02:59:25,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25203060] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:59:25,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847798933] [2023-11-29 02:59:25,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:25,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:59:25,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:59:25,544 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:59:25,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 02:59:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:25,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 02:59:25,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:59:25,744 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 [2023-11-29 02:59:25,819 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 02:59:25,819 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 [2023-11-29 02:59:25,845 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 [2023-11-29 02:59:25,906 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:59:25,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-29 02:59:25,950 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 02:59:25,950 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2023-11-29 02:59:25,992 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:59:25,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 02:59:26,128 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 [2023-11-29 02:59:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:26,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:59:26,204 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2023-11-29 02:59:26,204 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 19 treesize of output 18 [2023-11-29 02:59:26,208 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_ULTIMATE.start_main_~end~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) is different from false [2023-11-29 02:59:26,240 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1756 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1756))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_1758) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1)))) is different from false [2023-11-29 02:59:26,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:26,277 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 51 treesize of output 36 [2023-11-29 02:59:26,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:26,285 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 330 treesize of output 265 [2023-11-29 02:59:26,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:26,297 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 64 treesize of output 59 [2023-11-29 02:59:26,301 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 74 treesize of output 68 [2023-11-29 02:59:26,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:26,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847798933] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:59:26,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:59:26,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 29 [2023-11-29 02:59:26,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630574747] [2023-11-29 02:59:26,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:59:26,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 02:59:26,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:26,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 02:59:26,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=644, Unknown=15, NotChecked=106, Total=870 [2023-11-29 02:59:26,482 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 states have internal predecessors, (89), 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) [2023-11-29 02:59:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:27,402 INFO L93 Difference]: Finished difference Result 240 states and 265 transitions. [2023-11-29 02:59:27,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 02:59:27,403 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 states have internal predecessors, (89), 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 38 [2023-11-29 02:59:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:27,404 INFO L225 Difference]: With dead ends: 240 [2023-11-29 02:59:27,404 INFO L226 Difference]: Without dead ends: 240 [2023-11-29 02:59:27,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1154, Unknown=16, NotChecked=146, Total=1560 [2023-11-29 02:59:27,405 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 442 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 414 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:27,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 480 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1155 Invalid, 0 Unknown, 414 Unchecked, 0.7s Time] [2023-11-29 02:59:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-11-29 02:59:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 199. [2023-11-29 02:59:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 175 states have (on average 1.302857142857143) internal successors, (228), 197 states have internal predecessors, (228), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 231 transitions. [2023-11-29 02:59:27,410 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 231 transitions. Word has length 38 [2023-11-29 02:59:27,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:27,410 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 231 transitions. [2023-11-29 02:59:27,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 states have internal predecessors, (89), 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) [2023-11-29 02:59:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 231 transitions. [2023-11-29 02:59:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 02:59:27,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:27,411 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:27,416 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 02:59:27,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-29 02:59:27,612 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:27,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:27,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1863293121, now seen corresponding path program 1 times [2023-11-29 02:59:27,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:27,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151938271] [2023-11-29 02:59:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:27,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:28,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:28,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151938271] [2023-11-29 02:59:28,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151938271] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:59:28,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113916604] [2023-11-29 02:59:28,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:28,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:59:28,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:59:28,212 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:59:28,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 02:59:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:28,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 02:59:28,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:59:28,374 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 [2023-11-29 02:59:28,439 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 02:59:28,440 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 [2023-11-29 02:59:28,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 02:59:28,484 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 [2023-11-29 02:59:28,490 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 [2023-11-29 02:59:28,574 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:59:28,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-11-29 02:59:28,581 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 [2023-11-29 02:59:28,626 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 02:59:28,626 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2023-11-29 02:59:28,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:59:28,635 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 [2023-11-29 02:59:28,660 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:59:28,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:59:28,665 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 [2023-11-29 02:59:28,835 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 [2023-11-29 02:59:28,839 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 [2023-11-29 02:59:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:28,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:59:29,031 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1899 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1899) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 8))) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1899) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2023-11-29 02:59:29,053 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1899) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1900) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_1899 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1899) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 8))))) is different from false [2023-11-29 02:59:29,066 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1896) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1895) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1899) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 8))) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1895))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1896) .cse0 v_ArrVal_1899) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1900) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) is different from false [2023-11-29 02:59:29,079 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1895))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1896) .cse1 v_ArrVal_1899) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1900) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (forall ((v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1896) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1895) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1899) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) is different from false [2023-11-29 02:59:29,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:29,090 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 73 treesize of output 74 [2023-11-29 02:59:29,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:29,096 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 65 treesize of output 50 [2023-11-29 02:59:29,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:29,108 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 334 treesize of output 301 [2023-11-29 02:59:29,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:29,136 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 826 treesize of output 793 [2023-11-29 02:59:29,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 172 [2023-11-29 02:59:29,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:29,179 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 172 treesize of output 162 [2023-11-29 02:59:29,187 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 154 treesize of output 146 [2023-11-29 02:59:29,196 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 74 treesize of output 70 [2023-11-29 02:59:29,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:29,375 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2023-11-29 02:59:29,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:29,384 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-11-29 02:59:29,387 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:59:29,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2023-11-29 02:59:29,392 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:59:29,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:59:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:29,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113916604] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:59:29,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:59:29,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 31 [2023-11-29 02:59:29,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378776507] [2023-11-29 02:59:29,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:59:29,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 02:59:29,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:29,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 02:59:29,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=658, Unknown=4, NotChecked=220, Total=992 [2023-11-29 02:59:29,518 INFO L87 Difference]: Start difference. First operand 199 states and 231 transitions. Second operand has 32 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 32 states have internal predecessors, (108), 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) [2023-11-29 02:59:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:30,695 INFO L93 Difference]: Finished difference Result 249 states and 275 transitions. [2023-11-29 02:59:30,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 02:59:30,695 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 32 states have internal predecessors, (108), 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 38 [2023-11-29 02:59:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:30,696 INFO L225 Difference]: With dead ends: 249 [2023-11-29 02:59:30,696 INFO L226 Difference]: Without dead ends: 249 [2023-11-29 02:59:30,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=311, Invalid=1423, Unknown=4, NotChecked=332, Total=2070 [2023-11-29 02:59:30,697 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 723 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 844 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:30,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 462 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 978 Invalid, 0 Unknown, 844 Unchecked, 0.7s Time] [2023-11-29 02:59:30,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-11-29 02:59:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 203. [2023-11-29 02:59:30,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 201 states have internal predecessors, (231), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 234 transitions. [2023-11-29 02:59:30,702 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 234 transitions. Word has length 38 [2023-11-29 02:59:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:30,702 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 234 transitions. [2023-11-29 02:59:30,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 32 states have internal predecessors, (108), 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) [2023-11-29 02:59:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 234 transitions. [2023-11-29 02:59:30,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 02:59:30,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:30,703 INFO L195 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, 1, 1, 1, 1] [2023-11-29 02:59:30,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 02:59:30,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:59:30,904 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 02:59:30,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:30,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1648852028, now seen corresponding path program 1 times [2023-11-29 02:59:30,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:30,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358255460] [2023-11-29 02:59:30,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:30,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:32,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:32,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:32,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358255460] [2023-11-29 02:59:32,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358255460] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:59:32,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338704752] [2023-11-29 02:59:32,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:32,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:59:32,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:59:32,015 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:59:32,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 02:59:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:32,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-29 02:59:32,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:59:32,202 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 [2023-11-29 02:59:32,227 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 [2023-11-29 02:59:32,274 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 02:59:32,274 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 [2023-11-29 02:59:32,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:59:32,327 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 [2023-11-29 02:59:32,344 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 [2023-11-29 02:59:32,449 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:59:32,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:59:32,454 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 [2023-11-29 02:59:32,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:59:32,507 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 [2023-11-29 02:59:32,529 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 [2023-11-29 02:59:32,542 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-29 02:59:32,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-29 02:59:32,574 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 16 treesize of output 11 [2023-11-29 02:59:32,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2023-11-29 02:59:32,663 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:59:32,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2023-11-29 02:59:32,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:59:32,683 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 24 treesize of output 12 [2023-11-29 02:59:32,711 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 [2023-11-29 02:59:32,721 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 [2023-11-29 02:59:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:32,776 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:59:32,829 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2100 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2100) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2023-11-29 02:59:32,868 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2100 (Array Int Int)) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2097 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2098) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2097) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2100) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2023-11-29 02:59:32,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:32,921 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 33 treesize of output 34 [2023-11-29 02:59:32,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2023-11-29 02:59:32,928 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 24 treesize of output 22 [2023-11-29 02:59:33,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:33,733 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 60 treesize of output 52 [2023-11-29 02:59:33,737 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 97 treesize of output 85 [2023-11-29 02:59:33,743 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 42 treesize of output 38 [2023-11-29 02:59:33,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:33,900 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 63 treesize of output 55 [2023-11-29 02:59:33,903 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 104 treesize of output 92 [2023-11-29 02:59:33,908 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 57 treesize of output 53 [2023-11-29 02:59:33,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:33,976 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 86 treesize of output 78 [2023-11-29 02:59:33,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 137 [2023-11-29 02:59:33,989 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 68 treesize of output 64 [2023-11-29 02:59:51,264 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:59:51,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:59:51,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 3962 treesize of output 4063 [2023-11-29 02:59:51,863 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 1303 treesize of output 1299 [2023-11-29 02:59:51,949 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 1299 treesize of output 1291 [2023-11-29 02:59:52,016 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 1291 treesize of output 1283 [2023-11-29 02:59:52,083 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 1283 treesize of output 1259 [2023-11-29 02:59:52,148 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 1259 treesize of output 1243 [2023-11-29 02:59:52,216 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 1243 treesize of output 1239 [2023-11-29 02:59:52,261 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 1239 treesize of output 1231 [2023-11-29 02:59:52,314 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 1231 treesize of output 1223 [2023-11-29 02:59:52,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 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 1936 treesize of output 1926 [2023-11-29 02:59:52,837 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 1978 treesize of output 1960 [2023-11-29 02:59:52,893 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 8 treesize of output 4 [2023-11-29 02:59:52,896 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 8 treesize of output 4 [2023-11-29 02:59:52,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:59:53,010 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 93 treesize of output 85 [2023-11-29 02:59:53,018 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 97 treesize of output 85 [2023-11-29 02:59:53,026 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 55 treesize of output 47 [2023-11-29 02:59:53,034 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 102 treesize of output 74 [2023-11-29 02:59:53,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:59:53,076 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 62 treesize of output 58 [2023-11-29 02:59:53,084 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 138 treesize of output 126 [2023-11-29 02:59:53,092 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 143 treesize of output 119 [2023-11-29 02:59:53,137 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 58 treesize of output 50 [2023-11-29 02:59:53,142 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 25 treesize of output 21 [2023-11-29 02:59:53,147 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 24 treesize of output 20 [2023-11-29 02:59:53,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2023-11-29 02:59:53,172 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 25 treesize of output 21 [2023-11-29 02:59:53,178 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 40 treesize of output 28 [2023-11-29 02:59:53,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 7 treesize of output 3 [2023-11-29 02:59:53,202 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 69 treesize of output 57 [2023-11-29 02:59:53,207 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 37 treesize of output 29 [2023-11-29 02:59:53,212 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 25 treesize of output 21 [2023-11-29 02:59:53,235 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 29 treesize of output 25 [2023-11-29 02:59:53,239 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 25 treesize of output 21 [2023-11-29 02:59:53,244 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 28 treesize of output 20 [2023-11-29 02:59:53,269 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 153 treesize of output 137 [2023-11-29 02:59:53,277 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 256 treesize of output 216 [2023-11-29 02:59:53,286 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 94 treesize of output 86 [2023-11-29 02:59:53,297 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 43 treesize of output 39 [2023-11-29 02:59:53,377 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 29 treesize of output 25 [2023-11-29 02:59:53,383 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 25 treesize of output 21 [2023-11-29 02:59:53,388 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 28 treesize of output 20 [2023-11-29 02:59:53,398 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 8 treesize of output 4 [2023-11-29 02:59:53,401 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 8 treesize of output 4 [2023-11-29 02:59:53,404 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 8 treesize of output 4 [2023-11-29 02:59:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:54,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338704752] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:59:54,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:59:54,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 17] total 44 [2023-11-29 02:59:54,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158544310] [2023-11-29 02:59:54,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:59:54,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-29 02:59:54,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:54,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-29 02:59:54,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1448, Unknown=14, NotChecked=162, Total=1892 [2023-11-29 02:59:54,717 INFO L87 Difference]: Start difference. First operand 203 states and 234 transitions. Second operand has 44 states, 44 states have (on average 2.409090909090909) internal successors, (106), 44 states have internal predecessors, (106), 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) [2023-11-29 03:00:05,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:00:13,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:00:22,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:00:37,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:00:43,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:01:45,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:01:49,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:01:53,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:01:59,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:02:05,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:02:09,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:02:12,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:02:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:02:22,137 INFO L93 Difference]: Finished difference Result 299 states and 342 transitions. [2023-11-29 03:02:22,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-29 03:02:22,137 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.409090909090909) internal successors, (106), 44 states have internal predecessors, (106), 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 40 [2023-11-29 03:02:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:02:22,138 INFO L225 Difference]: With dead ends: 299 [2023-11-29 03:02:22,138 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 03:02:22,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 103.8s TimeCoverageRelationStatistics Valid=755, Invalid=3769, Unknown=40, NotChecked=266, Total=4830 [2023-11-29 03:02:22,140 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 650 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 67 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 407 IncrementalHoareTripleChecker+Unchecked, 62.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:02:22,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 609 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1548 Invalid, 22 Unknown, 407 Unchecked, 62.1s Time] [2023-11-29 03:02:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 03:02:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 232. [2023-11-29 03:02:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 208 states have (on average 1.2644230769230769) internal successors, (263), 230 states have internal predecessors, (263), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:02:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 266 transitions. [2023-11-29 03:02:22,144 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 266 transitions. Word has length 40 [2023-11-29 03:02:22,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:02:22,145 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 266 transitions. [2023-11-29 03:02:22,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.409090909090909) internal successors, (106), 44 states have internal predecessors, (106), 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) [2023-11-29 03:02:22,145 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 266 transitions. [2023-11-29 03:02:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 03:02:22,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:02:22,145 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:02:22,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 03:02:22,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:02:22,346 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:02:22,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:02:22,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1211603154, now seen corresponding path program 2 times [2023-11-29 03:02:22,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:02:22,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012566404] [2023-11-29 03:02:22,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:02:22,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:02:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:02:22,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:02:22,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012566404] [2023-11-29 03:02:22,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012566404] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:02:22,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409205887] [2023-11-29 03:02:22,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:02:22,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:02:22,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:02:22,988 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:02:22,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 03:02:23,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:02:23,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:02:23,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-29 03:02:23,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:02:23,263 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 [2023-11-29 03:02:23,393 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:02:23,394 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 [2023-11-29 03:02:23,441 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 [2023-11-29 03:02:23,452 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 [2023-11-29 03:02:23,603 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:02:23,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 03:02:23,611 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 [2023-11-29 03:02:23,705 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:02:23,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 03:02:23,727 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:02:23,727 INFO L378 Elim1Store]: Elim1 eliminated variable 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 27 treesize of output 22 [2023-11-29 03:02:23,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 03:02:23,830 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 [2023-11-29 03:02:24,485 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:02:24,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 21 [2023-11-29 03:02:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:02:24,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:02:25,062 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8))) (and (forall ((v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (or (not (= v_ArrVal_2240 (store (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2240 |c_ULTIMATE.start_main_~end~0#1.offset|)) .cse1 (select v_ArrVal_2240 .cse1)))) (= (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2241))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2240) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) |c_ULTIMATE.start_main_~null~0#1.offset|) (not (= (select v_ArrVal_2241 |c_ULTIMATE.start_main_~end~0#1.offset|) |c_ULTIMATE.start_main_~null~0#1.offset|)))) (forall ((v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (let ((.cse3 (select v_ArrVal_2240 |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= v_ArrVal_2240 (store (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| .cse3) .cse1 (select v_ArrVal_2240 .cse1)))) (= .cse3 (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2240))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2241) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (select v_ArrVal_2241 |c_ULTIMATE.start_main_~end~0#1.offset|) |c_ULTIMATE.start_main_~null~0#1.offset|))))))) is different from false [2023-11-29 03:02:25,095 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse4 (+ .cse0 8))) (and (forall ((v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (or (not (= (select v_ArrVal_2241 .cse0) |c_ULTIMATE.start_main_~null~0#1.offset|)) (= |c_ULTIMATE.start_main_~null~0#1.offset| (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_2241))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_2240) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (not (= (store (store .cse3 .cse0 (select v_ArrVal_2240 .cse0)) .cse4 (select v_ArrVal_2240 .cse4)) v_ArrVal_2240)))) (forall ((v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (let ((.cse5 (select v_ArrVal_2240 .cse0))) (or (not (= (select v_ArrVal_2241 .cse0) |c_ULTIMATE.start_main_~null~0#1.offset|)) (= .cse5 (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_2240))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_2241) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (store (store .cse3 .cse0 .cse5) .cse4 (select v_ArrVal_2240 .cse4)) v_ArrVal_2240)))))))) is different from false [2023-11-29 03:02:25,149 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2237 (Array Int Int)) (v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2237))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2236))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse3 (select v_ArrVal_2240 .cse2))) (or (not (= v_ArrVal_2240 (let ((.cse4 (+ .cse2 8))) (store (store (select .cse0 .cse1) .cse2 .cse3) .cse4 (select v_ArrVal_2240 .cse4))))) (= (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_2240))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store .cse6 .cse1 v_ArrVal_2241) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) .cse3) (not (= (select v_ArrVal_2241 .cse2) |c_ULTIMATE.start_main_~null~0#1.offset|))))))) (forall ((v_ArrVal_2237 (Array Int Int)) (v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2237)) (.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2236))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~null~0#1.offset| (let ((.cse7 (store .cse10 .cse9 v_ArrVal_2241))) (select (select .cse7 (select (select (store .cse8 .cse9 v_ArrVal_2240) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (not (= v_ArrVal_2240 (let ((.cse12 (+ .cse11 8))) (store (store (select .cse8 .cse9) .cse11 (select v_ArrVal_2240 .cse11)) .cse12 (select v_ArrVal_2240 .cse12))))) (not (= (select v_ArrVal_2241 .cse11) |c_ULTIMATE.start_main_~null~0#1.offset|))))))) is different from false [2023-11-29 03:02:25,191 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_2237 (Array Int Int)) (v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_2237))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse0 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_2236))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse3 (select v_ArrVal_2240 .cse2))) (or (not (= v_ArrVal_2240 (let ((.cse4 (+ .cse2 8))) (store (store (select .cse0 .cse1) .cse2 .cse3) .cse4 (select v_ArrVal_2240 .cse4))))) (= (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_2240))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store .cse6 .cse1 v_ArrVal_2241) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) .cse3) (not (= (select v_ArrVal_2241 .cse2) |c_ULTIMATE.start_main_~null~0#1.offset|))))))) (forall ((v_ArrVal_2237 (Array Int Int)) (v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_2237)) (.cse8 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_2236))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= v_ArrVal_2240 (let ((.cse11 (+ .cse10 8))) (store (store (select .cse8 .cse9) .cse10 (select v_ArrVal_2240 .cse10)) .cse11 (select v_ArrVal_2240 .cse11))))) (= |c_ULTIMATE.start_main_~null~0#1.offset| (let ((.cse12 (store .cse13 .cse9 v_ArrVal_2241))) (select (select .cse12 (select (select (store .cse8 .cse9 v_ArrVal_2240) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse12 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (not (= (select v_ArrVal_2241 .cse10) |c_ULTIMATE.start_main_~null~0#1.offset|)))))))) is different from false [2023-11-29 03:02:25,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:02:25,208 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 247 treesize of output 199 [2023-11-29 03:02:25,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:02:25,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 130 [2023-11-29 03:02:25,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:02:25,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 2932 treesize of output 2842 [2023-11-29 03:02:25,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:02:25,662 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 6248 treesize of output 5531 [2023-11-29 03:02:25,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:02:25,844 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 1452 treesize of output 1394 [2023-11-29 03:02:25,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:02:25,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1308 treesize of output 1296 [2023-11-29 03:02:27,033 INFO L349 Elim1Store]: treesize reduction 340, result has 46.1 percent of original size [2023-11-29 03:02:27,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 1456 treesize of output 1610 [2023-11-29 03:02:29,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 03:09:02,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 03:09:02,726 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 03:09:02,727 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 03:09:02,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 03:09:02,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:09:02,928 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2023-11-29 03:09:02,931 INFO L158 Benchmark]: Toolchain (without parser) took 597260.54ms. Allocated memory was 151.0MB in the beginning and 461.4MB in the end (delta: 310.4MB). Free memory was 110.9MB in the beginning and 319.2MB in the end (delta: -208.3MB). Peak memory consumption was 289.2MB. Max. memory is 16.1GB. [2023-11-29 03:09:02,931 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:09:02,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.97ms. Allocated memory is still 151.0MB. Free memory was 110.9MB in the beginning and 92.6MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 03:09:02,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.32ms. Allocated memory is still 151.0MB. Free memory was 92.6MB in the beginning and 90.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:09:02,932 INFO L158 Benchmark]: Boogie Preprocessor took 53.08ms. Allocated memory is still 151.0MB. Free memory was 90.5MB in the beginning and 87.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:09:02,932 INFO L158 Benchmark]: RCFGBuilder took 574.24ms. Allocated memory is still 151.0MB. Free memory was 87.4MB in the beginning and 117.8MB in the end (delta: -30.4MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2023-11-29 03:09:02,932 INFO L158 Benchmark]: TraceAbstraction took 596206.06ms. Allocated memory was 182.5MB in the beginning and 461.4MB in the end (delta: 278.9MB). Free memory was 150.5MB in the beginning and 319.2MB in the end (delta: -168.7MB). Peak memory consumption was 295.9MB. Max. memory is 16.1GB. [2023-11-29 03:09:02,933 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.97ms. Allocated memory is still 151.0MB. Free memory was 110.9MB in the beginning and 92.6MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.32ms. Allocated memory is still 151.0MB. Free memory was 92.6MB in the beginning and 90.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.08ms. Allocated memory is still 151.0MB. Free memory was 90.5MB in the beginning and 87.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 574.24ms. Allocated memory is still 151.0MB. Free memory was 87.4MB in the beginning and 117.8MB in the end (delta: -30.4MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * TraceAbstraction took 596206.06ms. Allocated memory was 182.5MB in the beginning and 461.4MB in the end (delta: 278.9MB). Free memory was 150.5MB in the beginning and 319.2MB in the end (delta: -168.7MB). Peak memory consumption was 295.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya --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 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:09:04,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:09:04,701 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 03:09:04,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:09:04,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:09:04,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:09:04,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:09:04,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:09:04,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:09:04,735 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:09:04,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:09:04,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:09:04,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:09:04,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:09:04,738 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:09:04,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:09:04,739 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:09:04,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:09:04,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:09:04,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:09:04,741 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:09:04,742 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:09:04,742 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:09:04,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:09:04,743 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:09:04,743 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:09:04,743 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:09:04,744 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:09:04,744 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:09:04,744 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:09:04,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:09:04,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:09:04,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:09:04,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:09:04,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:09:04,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:09:04,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:09:04,747 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:09:04,747 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:09:04,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:09:04,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:09:04,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:09:04,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:09:04,748 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:09:04,748 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_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/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_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b [2023-11-29 03:09:05,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:09:05,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:09:05,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:09:05,055 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:09:05,056 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:09:05,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2023-11-29 03:09:07,776 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:09:07,991 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:09:07,992 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2023-11-29 03:09:08,006 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/data/04469526c/3762916e87f14aed8b4ac560b9c8175d/FLAGdbe9c1f6f [2023-11-29 03:09:08,017 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/data/04469526c/3762916e87f14aed8b4ac560b9c8175d [2023-11-29 03:09:08,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:09:08,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:09:08,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:09:08,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:09:08,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:09:08,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:09:08" (1/1) ... [2023-11-29 03:09:08,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139d50ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:08, skipping insertion in model container [2023-11-29 03:09:08,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:09:08" (1/1) ... [2023-11-29 03:09:08,087 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:09:08,360 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:09:08,374 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:09:08,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:09:08,459 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:09:08,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:08 WrapperNode [2023-11-29 03:09:08,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:09:08,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:09:08,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:09:08,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:09:08,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:08" (1/1) ... [2023-11-29 03:09:08,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:08" (1/1) ... [2023-11-29 03:09:08,512 INFO L138 Inliner]: procedures = 122, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 169 [2023-11-29 03:09:08,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:09:08,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:09:08,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:09:08,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:09:08,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:08" (1/1) ... [2023-11-29 03:09:08,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:08" (1/1) ... [2023-11-29 03:09:08,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:08" (1/1) ... [2023-11-29 03:09:08,549 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 15 writes are split as follows [0, 15]. [2023-11-29 03:09:08,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:08" (1/1) ... [2023-11-29 03:09:08,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:08" (1/1) ... [2023-11-29 03:09:08,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:08" (1/1) ... [2023-11-29 03:09:08,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:08" (1/1) ... [2023-11-29 03:09:08,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:08" (1/1) ... [2023-11-29 03:09:08,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:08" (1/1) ... [2023-11-29 03:09:08,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:09:08,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:09:08,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:09:08,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:09:08,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:08" (1/1) ... [2023-11-29 03:09:08,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:09:08,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:09:08,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:09:08,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:09:08,656 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 03:09:08,656 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 03:09:08,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 03:09:08,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 03:09:08,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:09:08,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:09:08,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:09:08,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:09:08,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:09:08,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:09:08,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:09:08,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 03:09:08,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 03:09:08,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:09:08,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 03:09:08,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:09:08,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:09:08,785 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:09:08,787 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:09:09,424 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:09:09,470 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:09:09,470 INFO L309 CfgBuilder]: Removed 17 assume(true) statements. [2023-11-29 03:09:09,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:09:09 BoogieIcfgContainer [2023-11-29 03:09:09,471 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:09:09,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:09:09,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:09:09,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:09:09,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:09:08" (1/3) ... [2023-11-29 03:09:09,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e5f163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:09:09, skipping insertion in model container [2023-11-29 03:09:09,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:08" (2/3) ... [2023-11-29 03:09:09,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e5f163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:09:09, skipping insertion in model container [2023-11-29 03:09:09,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:09:09" (3/3) ... [2023-11-29 03:09:09,479 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2023-11-29 03:09:09,500 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:09:09,500 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 74 error locations. [2023-11-29 03:09:09,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:09:09,545 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@37870bb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:09:09,545 INFO L358 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2023-11-29 03:09:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 76 states have (on average 2.3815789473684212) internal successors, (181), 150 states have internal predecessors, (181), 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) [2023-11-29 03:09:09,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:09:09,555 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:09,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:09:09,556 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:09,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:09,562 INFO L85 PathProgramCache]: Analyzing trace with hash 11669, now seen corresponding path program 1 times [2023-11-29 03:09:09,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:09,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989414287] [2023-11-29 03:09:09,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:09,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:09,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:09,576 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:09,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 03:09:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:09,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:09:09,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:09,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:09:09,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:09,714 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:09,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:09,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989414287] [2023-11-29 03:09:09,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989414287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:09,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:09,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:09:09,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027643676] [2023-11-29 03:09:09,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:09,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:09:09,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:09,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:09:09,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:09:09,746 INFO L87 Difference]: Start difference. First operand has 159 states, 76 states have (on average 2.3815789473684212) internal successors, (181), 150 states have internal predecessors, (181), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-29 03:09:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:10,115 INFO L93 Difference]: Finished difference Result 175 states and 188 transitions. [2023-11-29 03:09:10,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:09:10,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-29 03:09:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:10,127 INFO L225 Difference]: With dead ends: 175 [2023-11-29 03:09:10,127 INFO L226 Difference]: Without dead ends: 174 [2023-11-29 03:09:10,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:09:10,132 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 130 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:10,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 99 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:09:10,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-29 03:09:10,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2023-11-29 03:09:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 72 states have (on average 2.1805555555555554) internal successors, (157), 148 states have internal predecessors, (157), 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) [2023-11-29 03:09:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2023-11-29 03:09:10,176 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 2 [2023-11-29 03:09:10,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:10,177 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2023-11-29 03:09:10,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-29 03:09:10,178 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2023-11-29 03:09:10,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:09:10,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:10,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:09:10,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:09:10,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:10,379 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:10,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:10,380 INFO L85 PathProgramCache]: Analyzing trace with hash 11670, now seen corresponding path program 1 times [2023-11-29 03:09:10,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:10,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443381745] [2023-11-29 03:09:10,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:10,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:10,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:10,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:10,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 03:09:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:09:10,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:10,434 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 [2023-11-29 03:09:10,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:10,448 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:10,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:10,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443381745] [2023-11-29 03:09:10,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443381745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:10,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:10,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:09:10,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734491257] [2023-11-29 03:09:10,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:10,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:09:10,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:10,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:09:10,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:09:10,452 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-29 03:09:10,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:10,817 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2023-11-29 03:09:10,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:09:10,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-29 03:09:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:10,819 INFO L225 Difference]: With dead ends: 146 [2023-11-29 03:09:10,819 INFO L226 Difference]: Without dead ends: 146 [2023-11-29 03:09:10,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:09:10,821 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 140 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:10,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 79 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:09:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-29 03:09:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2023-11-29 03:09:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 72 states have (on average 2.111111111111111) internal successors, (152), 144 states have internal predecessors, (152), 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) [2023-11-29 03:09:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2023-11-29 03:09:10,841 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 2 [2023-11-29 03:09:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:10,842 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2023-11-29 03:09:10,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-29 03:09:10,842 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2023-11-29 03:09:10,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 03:09:10,843 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:10,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:09:10,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 03:09:11,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:11,045 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:11,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:11,046 INFO L85 PathProgramCache]: Analyzing trace with hash 347626676, now seen corresponding path program 1 times [2023-11-29 03:09:11,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:11,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844006061] [2023-11-29 03:09:11,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:11,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:11,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:11,048 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:11,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 03:09:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:11,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:09:11,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:11,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:09:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:11,130 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:11,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:11,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844006061] [2023-11-29 03:09:11,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844006061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:11,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:11,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:09:11,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444086589] [2023-11-29 03:09:11,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:11,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:09:11,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:11,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:09:11,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:09:11,134 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-29 03:09:11,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:11,391 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2023-11-29 03:09:11,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:09:11,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2023-11-29 03:09:11,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:11,393 INFO L225 Difference]: With dead ends: 142 [2023-11-29 03:09:11,393 INFO L226 Difference]: Without dead ends: 142 [2023-11-29 03:09:11,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:09:11,394 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 116 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:11,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 90 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:09:11,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-29 03:09:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2023-11-29 03:09:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 73 states have (on average 2.0136986301369864) internal successors, (147), 138 states have internal predecessors, (147), 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) [2023-11-29 03:09:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2023-11-29 03:09:11,404 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 5 [2023-11-29 03:09:11,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:11,405 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2023-11-29 03:09:11,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-29 03:09:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2023-11-29 03:09:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 03:09:11,406 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:11,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:09:11,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 03:09:11,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:11,609 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:11,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash 347626677, now seen corresponding path program 1 times [2023-11-29 03:09:11,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:11,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188209788] [2023-11-29 03:09:11,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:11,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:11,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:11,625 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:11,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 03:09:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:11,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:09:11,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:11,695 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 [2023-11-29 03:09:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:11,705 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:11,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:11,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188209788] [2023-11-29 03:09:11,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188209788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:11,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:11,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:09:11,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945452301] [2023-11-29 03:09:11,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:11,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:09:11,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:11,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:09:11,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:09:11,707 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-29 03:09:12,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:12,019 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2023-11-29 03:09:12,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:09:12,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2023-11-29 03:09:12,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:12,021 INFO L225 Difference]: With dead ends: 154 [2023-11-29 03:09:12,021 INFO L226 Difference]: Without dead ends: 154 [2023-11-29 03:09:12,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:09:12,022 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 113 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:12,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 98 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:09:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-29 03:09:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 142. [2023-11-29 03:09:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 78 states have (on average 1.9102564102564104) internal successors, (149), 140 states have internal predecessors, (149), 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) [2023-11-29 03:09:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2023-11-29 03:09:12,032 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 5 [2023-11-29 03:09:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:12,033 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2023-11-29 03:09:12,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-29 03:09:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2023-11-29 03:09:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 03:09:12,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:12,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:12,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 03:09:12,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:12,236 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:12,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:12,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1334688605, now seen corresponding path program 1 times [2023-11-29 03:09:12,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:12,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963296837] [2023-11-29 03:09:12,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:12,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:12,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:12,238 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:12,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 03:09:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:09:12,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:12,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:09:12,385 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:09:12,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 03:09:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:12,400 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:12,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:12,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963296837] [2023-11-29 03:09:12,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963296837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:12,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:12,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:09:12,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490471019] [2023-11-29 03:09:12,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:12,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:09:12,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:12,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:09:12,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:09:12,402 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-29 03:09:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:12,781 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2023-11-29 03:09:12,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:09:12,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2023-11-29 03:09:12,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:12,783 INFO L225 Difference]: With dead ends: 140 [2023-11-29 03:09:12,783 INFO L226 Difference]: Without dead ends: 140 [2023-11-29 03:09:12,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:09:12,785 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 178 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:12,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 77 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:09:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-29 03:09:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129. [2023-11-29 03:09:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 80 states have (on average 1.725) internal successors, (138), 127 states have internal predecessors, (138), 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) [2023-11-29 03:09:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2023-11-29 03:09:12,793 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 10 [2023-11-29 03:09:12,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:12,793 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2023-11-29 03:09:12,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-29 03:09:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2023-11-29 03:09:12,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 03:09:12,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:12,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:12,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-29 03:09:12,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:12,997 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:12,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:12,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1334688606, now seen corresponding path program 1 times [2023-11-29 03:09:12,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:12,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406751838] [2023-11-29 03:09:12,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:12,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:12,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:12,999 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:13,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 03:09:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:13,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:09:13,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:13,103 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 [2023-11-29 03:09:13,180 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 03:09:13,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 03:09:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:13,197 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:13,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:13,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406751838] [2023-11-29 03:09:13,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406751838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:13,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:13,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:09:13,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331285026] [2023-11-29 03:09:13,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:13,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:09:13,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:13,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:09:13,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:09:13,199 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-29 03:09:13,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:13,726 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2023-11-29 03:09:13,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:09:13,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2023-11-29 03:09:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:13,728 INFO L225 Difference]: With dead ends: 163 [2023-11-29 03:09:13,728 INFO L226 Difference]: Without dead ends: 163 [2023-11-29 03:09:13,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:09:13,729 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 152 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:13,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 110 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:09:13,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-29 03:09:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 137. [2023-11-29 03:09:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 89 states have (on average 1.6741573033707866) internal successors, (149), 135 states have internal predecessors, (149), 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) [2023-11-29 03:09:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2023-11-29 03:09:13,736 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 10 [2023-11-29 03:09:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:13,736 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2023-11-29 03:09:13,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-29 03:09:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2023-11-29 03:09:13,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 03:09:13,737 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:13,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:13,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 03:09:13,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:13,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:13,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:13,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1559181362, now seen corresponding path program 1 times [2023-11-29 03:09:13,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:13,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536450564] [2023-11-29 03:09:13,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:13,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:13,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:13,943 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:13,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 03:09:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:14,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:09:14,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:14,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:09:14,044 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 15 treesize of output 1 [2023-11-29 03:09:14,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 03:09:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:14,068 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:14,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:14,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536450564] [2023-11-29 03:09:14,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536450564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:14,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:14,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:09:14,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691509807] [2023-11-29 03:09:14,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:14,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:09:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:14,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:09:14,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:09:14,070 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2023-11-29 03:09:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:14,511 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2023-11-29 03:09:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:09:14,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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 [2023-11-29 03:09:14,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:14,513 INFO L225 Difference]: With dead ends: 136 [2023-11-29 03:09:14,513 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 03:09:14,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:09:14,514 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 6 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:14,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 310 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:09:14,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 03:09:14,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-11-29 03:09:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 89 states have (on average 1.651685393258427) internal successors, (147), 134 states have internal predecessors, (147), 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) [2023-11-29 03:09:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2023-11-29 03:09:14,519 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 12 [2023-11-29 03:09:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:14,520 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2023-11-29 03:09:14,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2023-11-29 03:09:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2023-11-29 03:09:14,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 03:09:14,520 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:14,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:14,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 03:09:14,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:14,721 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:14,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:14,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1559181361, now seen corresponding path program 1 times [2023-11-29 03:09:14,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:14,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025945857] [2023-11-29 03:09:14,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:14,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:14,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:14,723 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:14,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 03:09:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:14,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 03:09:14,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:14,831 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 [2023-11-29 03:09:14,849 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 [2023-11-29 03:09:14,855 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 15 treesize of output 1 [2023-11-29 03:09:14,887 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 17 treesize of output 9 [2023-11-29 03:09:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:14,903 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:14,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:14,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025945857] [2023-11-29 03:09:14,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025945857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:14,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:14,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:09:14,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670248123] [2023-11-29 03:09:14,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:14,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:09:14,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:14,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:09:14,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:09:14,904 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2023-11-29 03:09:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:15,441 INFO L93 Difference]: Finished difference Result 135 states and 152 transitions. [2023-11-29 03:09:15,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:09:15,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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 [2023-11-29 03:09:15,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:15,442 INFO L225 Difference]: With dead ends: 135 [2023-11-29 03:09:15,442 INFO L226 Difference]: Without dead ends: 135 [2023-11-29 03:09:15,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:09:15,443 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 3 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:15,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 299 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:09:15,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-29 03:09:15,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-11-29 03:09:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 133 states have internal predecessors, (145), 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) [2023-11-29 03:09:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2023-11-29 03:09:15,448 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 12 [2023-11-29 03:09:15,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:15,448 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2023-11-29 03:09:15,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2023-11-29 03:09:15,449 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2023-11-29 03:09:15,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 03:09:15,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:15,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:15,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 03:09:15,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:15,650 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:15,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:15,650 INFO L85 PathProgramCache]: Analyzing trace with hash 342184981, now seen corresponding path program 1 times [2023-11-29 03:09:15,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:15,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585036420] [2023-11-29 03:09:15,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:15,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:15,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:15,652 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:15,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 03:09:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:15,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:09:15,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:15,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:09:15,757 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:09:15,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:09:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:15,789 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:15,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:15,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585036420] [2023-11-29 03:09:15,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585036420] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:15,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:15,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:09:15,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920748718] [2023-11-29 03:09:15,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:15,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:09:15,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:15,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:09:15,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:09:15,791 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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) [2023-11-29 03:09:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:16,249 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2023-11-29 03:09:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:09:16,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 14 [2023-11-29 03:09:16,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:16,250 INFO L225 Difference]: With dead ends: 169 [2023-11-29 03:09:16,250 INFO L226 Difference]: Without dead ends: 169 [2023-11-29 03:09:16,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:09:16,251 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 242 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:16,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 142 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:09:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-11-29 03:09:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 137. [2023-11-29 03:09:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.5978260869565217) internal successors, (147), 135 states have internal predecessors, (147), 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) [2023-11-29 03:09:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 153 transitions. [2023-11-29 03:09:16,257 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 153 transitions. Word has length 14 [2023-11-29 03:09:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:16,257 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 153 transitions. [2023-11-29 03:09:16,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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) [2023-11-29 03:09:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 153 transitions. [2023-11-29 03:09:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 03:09:16,258 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:16,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:16,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 03:09:16,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:16,458 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:16,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:16,459 INFO L85 PathProgramCache]: Analyzing trace with hash 570592693, now seen corresponding path program 1 times [2023-11-29 03:09:16,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:16,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265386149] [2023-11-29 03:09:16,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:16,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:16,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:16,460 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:16,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 03:09:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:16,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 03:09:16,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:16,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:09:16,642 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:09:16,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:09:16,685 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 [2023-11-29 03:09:16,767 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:09:16,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:09:16,787 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 27 treesize of output 15 [2023-11-29 03:09:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:16,821 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:16,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:16,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265386149] [2023-11-29 03:09:16,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265386149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:16,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:16,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:09:16,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150118070] [2023-11-29 03:09:16,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:16,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:09:16,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:16,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:09:16,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:09:16,823 INFO L87 Difference]: Start difference. First operand 137 states and 153 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:17,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:17,640 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2023-11-29 03:09:17,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:09:17,640 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 03:09:17,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:17,641 INFO L225 Difference]: With dead ends: 163 [2023-11-29 03:09:17,641 INFO L226 Difference]: Without dead ends: 163 [2023-11-29 03:09:17,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:09:17,642 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 212 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:17,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 198 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:09:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-29 03:09:17,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 136. [2023-11-29 03:09:17,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 92 states have (on average 1.5869565217391304) internal successors, (146), 134 states have internal predecessors, (146), 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) [2023-11-29 03:09:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2023-11-29 03:09:17,646 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 14 [2023-11-29 03:09:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:17,646 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2023-11-29 03:09:17,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2023-11-29 03:09:17,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 03:09:17,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:17,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:17,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 03:09:17,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:17,848 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:17,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:17,848 INFO L85 PathProgramCache]: Analyzing trace with hash 570592694, now seen corresponding path program 1 times [2023-11-29 03:09:17,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:17,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049232213] [2023-11-29 03:09:17,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:17,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:17,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:17,850 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:17,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 03:09:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:17,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 03:09:17,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:17,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:09:18,032 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:09:18,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:09:18,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:09:18,065 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 [2023-11-29 03:09:18,074 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 [2023-11-29 03:09:18,156 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:09:18,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-11-29 03:09:18,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:09:18,186 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 [2023-11-29 03:09:18,194 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 [2023-11-29 03:09:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:18,213 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:18,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:18,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049232213] [2023-11-29 03:09:18,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049232213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:18,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:18,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:09:18,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166798481] [2023-11-29 03:09:18,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:18,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:09:18,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:18,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:09:18,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:09:18,214 INFO L87 Difference]: Start difference. First operand 136 states and 152 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:19,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:19,501 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2023-11-29 03:09:19,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:09:19,502 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 03:09:19,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:19,503 INFO L225 Difference]: With dead ends: 148 [2023-11-29 03:09:19,503 INFO L226 Difference]: Without dead ends: 148 [2023-11-29 03:09:19,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:09:19,504 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 182 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:19,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 246 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 03:09:19,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-29 03:09:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2023-11-29 03:09:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 100 states have (on average 1.51) internal successors, (151), 136 states have internal predecessors, (151), 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) [2023-11-29 03:09:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 157 transitions. [2023-11-29 03:09:19,509 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 157 transitions. Word has length 14 [2023-11-29 03:09:19,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:19,509 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 157 transitions. [2023-11-29 03:09:19,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 157 transitions. [2023-11-29 03:09:19,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 03:09:19,510 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:19,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:19,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 03:09:19,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:19,711 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:19,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:19,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1295017745, now seen corresponding path program 1 times [2023-11-29 03:09:19,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:19,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970791226] [2023-11-29 03:09:19,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:19,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:19,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:19,712 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:19,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 03:09:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:19,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 03:09:19,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:19,817 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 [2023-11-29 03:09:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:19,869 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:19,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:19,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970791226] [2023-11-29 03:09:19,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970791226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:19,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:19,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:09:19,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212844762] [2023-11-29 03:09:19,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:19,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:09:19,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:19,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:09:19,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:09:19,871 INFO L87 Difference]: Start difference. First operand 138 states and 157 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-11-29 03:09:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:20,394 INFO L93 Difference]: Finished difference Result 188 states and 214 transitions. [2023-11-29 03:09:20,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:09:20,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 17 [2023-11-29 03:09:20,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:20,396 INFO L225 Difference]: With dead ends: 188 [2023-11-29 03:09:20,396 INFO L226 Difference]: Without dead ends: 188 [2023-11-29 03:09:20,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:09:20,397 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 190 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:20,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 280 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:09:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-29 03:09:20,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 145. [2023-11-29 03:09:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 107 states have (on average 1.485981308411215) internal successors, (159), 143 states have internal predecessors, (159), 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) [2023-11-29 03:09:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2023-11-29 03:09:20,402 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 17 [2023-11-29 03:09:20,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:20,402 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2023-11-29 03:09:20,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-11-29 03:09:20,403 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2023-11-29 03:09:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:09:20,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:20,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:20,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 03:09:20,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:20,605 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:20,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:20,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1834740430, now seen corresponding path program 1 times [2023-11-29 03:09:20,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:20,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864557599] [2023-11-29 03:09:20,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:20,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:20,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:20,607 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:20,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 03:09:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:20,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:09:20,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:20,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:09:20,772 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 15 treesize of output 1 [2023-11-29 03:09:20,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 03:09:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:20,793 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:20,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:20,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864557599] [2023-11-29 03:09:20,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864557599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:20,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:20,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:09:20,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903988479] [2023-11-29 03:09:20,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:20,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:09:20,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:20,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:09:20,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:09:20,795 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2023-11-29 03:09:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:21,319 INFO L93 Difference]: Finished difference Result 144 states and 164 transitions. [2023-11-29 03:09:21,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:09:21,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2023-11-29 03:09:21,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:21,321 INFO L225 Difference]: With dead ends: 144 [2023-11-29 03:09:21,321 INFO L226 Difference]: Without dead ends: 144 [2023-11-29 03:09:21,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:09:21,321 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 3 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:21,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 286 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:09:21,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-29 03:09:21,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2023-11-29 03:09:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 142 states have internal predecessors, (158), 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) [2023-11-29 03:09:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 164 transitions. [2023-11-29 03:09:21,326 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 164 transitions. Word has length 19 [2023-11-29 03:09:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:21,326 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 164 transitions. [2023-11-29 03:09:21,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2023-11-29 03:09:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 164 transitions. [2023-11-29 03:09:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:09:21,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:21,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:21,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 03:09:21,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:21,531 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:21,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:21,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1834740429, now seen corresponding path program 1 times [2023-11-29 03:09:21,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:21,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448920625] [2023-11-29 03:09:21,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:21,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:21,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:21,533 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:21,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 03:09:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:21,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 03:09:21,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:21,673 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 [2023-11-29 03:09:21,691 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 [2023-11-29 03:09:21,697 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 15 treesize of output 1 [2023-11-29 03:09:21,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 03:09:21,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:21,733 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:21,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:21,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448920625] [2023-11-29 03:09:21,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448920625] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:21,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:21,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:09:21,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769851481] [2023-11-29 03:09:21,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:21,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:09:21,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:21,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:09:21,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:09:21,735 INFO L87 Difference]: Start difference. First operand 144 states and 164 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2023-11-29 03:09:22,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:22,190 INFO L93 Difference]: Finished difference Result 143 states and 163 transitions. [2023-11-29 03:09:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:09:22,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2023-11-29 03:09:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:22,192 INFO L225 Difference]: With dead ends: 143 [2023-11-29 03:09:22,192 INFO L226 Difference]: Without dead ends: 143 [2023-11-29 03:09:22,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:09:22,193 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:22,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 280 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:09:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-29 03:09:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2023-11-29 03:09:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 141 states have internal predecessors, (157), 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) [2023-11-29 03:09:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 163 transitions. [2023-11-29 03:09:22,198 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 163 transitions. Word has length 19 [2023-11-29 03:09:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:22,198 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 163 transitions. [2023-11-29 03:09:22,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2023-11-29 03:09:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 163 transitions. [2023-11-29 03:09:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 03:09:22,199 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:22,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:22,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 03:09:22,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:22,400 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:22,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:22,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1809377916, now seen corresponding path program 1 times [2023-11-29 03:09:22,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:22,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096986508] [2023-11-29 03:09:22,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:22,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:22,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:22,402 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:22,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 03:09:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:22,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:09:22,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:22,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:09:22,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:22,530 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:22,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:22,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096986508] [2023-11-29 03:09:22,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096986508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:22,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:22,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:09:22,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521986139] [2023-11-29 03:09:22,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:22,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:09:22,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:22,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:09:22,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:09:22,531 INFO L87 Difference]: Start difference. First operand 143 states and 163 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2023-11-29 03:09:22,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:22,789 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2023-11-29 03:09:22,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:09:22,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 21 [2023-11-29 03:09:22,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:22,790 INFO L225 Difference]: With dead ends: 142 [2023-11-29 03:09:22,790 INFO L226 Difference]: Without dead ends: 142 [2023-11-29 03:09:22,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:09:22,791 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 18 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:22,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 212 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:09:22,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-29 03:09:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-11-29 03:09:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 107 states have (on average 1.4485981308411215) internal successors, (155), 140 states have internal predecessors, (155), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2023-11-29 03:09:22,795 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 21 [2023-11-29 03:09:22,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:22,795 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2023-11-29 03:09:22,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2023-11-29 03:09:22,795 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2023-11-29 03:09:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 03:09:22,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:22,796 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:22,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-29 03:09:22,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:22,997 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:22,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:22,997 INFO L85 PathProgramCache]: Analyzing trace with hash 596696695, now seen corresponding path program 1 times [2023-11-29 03:09:22,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:22,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189633027] [2023-11-29 03:09:22,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:22,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:22,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:22,998 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:22,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 03:09:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:23,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 03:09:23,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:23,141 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 [2023-11-29 03:09:23,150 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 [2023-11-29 03:09:23,178 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 19 treesize of output 18 [2023-11-29 03:09:23,190 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 23 treesize of output 11 [2023-11-29 03:09:23,231 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 23 treesize of output 11 [2023-11-29 03:09:23,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 03:09:23,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 03:09:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:23,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:09:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:23,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189633027] [2023-11-29 03:09:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189633027] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:09:23,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:09:23,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2023-11-29 03:09:23,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178438940] [2023-11-29 03:09:23,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:09:23,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:09:23,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:23,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:09:23,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:09:23,668 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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) [2023-11-29 03:09:24,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:24,993 INFO L93 Difference]: Finished difference Result 202 states and 226 transitions. [2023-11-29 03:09:24,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:09:24,993 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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 21 [2023-11-29 03:09:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:24,994 INFO L225 Difference]: With dead ends: 202 [2023-11-29 03:09:24,994 INFO L226 Difference]: Without dead ends: 202 [2023-11-29 03:09:24,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:09:24,995 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 347 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:24,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 261 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 03:09:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-29 03:09:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 169. [2023-11-29 03:09:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 134 states have (on average 1.4477611940298507) internal successors, (194), 167 states have internal predecessors, (194), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 199 transitions. [2023-11-29 03:09:24,999 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 199 transitions. Word has length 21 [2023-11-29 03:09:24,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:24,999 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 199 transitions. [2023-11-29 03:09:24,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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) [2023-11-29 03:09:24,999 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 199 transitions. [2023-11-29 03:09:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 03:09:25,000 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:25,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:25,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 03:09:25,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:25,200 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:25,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:25,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2046264024, now seen corresponding path program 1 times [2023-11-29 03:09:25,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:25,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104314372] [2023-11-29 03:09:25,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:25,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:25,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:25,202 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:25,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 03:09:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:25,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 03:09:25,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:25,460 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:09:25,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:09:25,483 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 [2023-11-29 03:09:25,554 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:09:25,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:09:25,567 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 27 treesize of output 15 [2023-11-29 03:09:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:25,587 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:25,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:25,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104314372] [2023-11-29 03:09:25,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104314372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:25,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:25,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:09:25,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351251678] [2023-11-29 03:09:25,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:25,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:09:25,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:25,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:09:25,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:09:25,589 INFO L87 Difference]: Start difference. First operand 169 states and 199 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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) [2023-11-29 03:09:26,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:26,355 INFO L93 Difference]: Finished difference Result 171 states and 201 transitions. [2023-11-29 03:09:26,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:09:26,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2023-11-29 03:09:26,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:26,357 INFO L225 Difference]: With dead ends: 171 [2023-11-29 03:09:26,357 INFO L226 Difference]: Without dead ends: 171 [2023-11-29 03:09:26,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:09:26,357 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 24 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:26,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 304 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:09:26,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-29 03:09:26,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2023-11-29 03:09:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 166 states have internal predecessors, (193), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:26,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 198 transitions. [2023-11-29 03:09:26,361 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 198 transitions. Word has length 21 [2023-11-29 03:09:26,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:26,361 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 198 transitions. [2023-11-29 03:09:26,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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) [2023-11-29 03:09:26,362 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 198 transitions. [2023-11-29 03:09:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 03:09:26,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:26,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:26,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-11-29 03:09:26,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:26,563 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:26,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:26,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2046264025, now seen corresponding path program 1 times [2023-11-29 03:09:26,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:26,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734091900] [2023-11-29 03:09:26,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:26,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:26,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:26,565 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:26,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 03:09:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:26,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 03:09:26,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:26,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:09:26,846 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:09:26,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:09:26,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:09:26,891 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 [2023-11-29 03:09:26,961 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:09:26,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2023-11-29 03:09:26,978 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 36 treesize of output 20 [2023-11-29 03:09:27,066 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-29 03:09:27,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 03:09:27,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 03:09:27,107 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 [2023-11-29 03:09:27,118 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 [2023-11-29 03:09:27,209 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:09:27,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-11-29 03:09:27,218 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 [2023-11-29 03:09:27,240 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 [2023-11-29 03:09:27,245 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 [2023-11-29 03:09:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:27,277 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:27,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:27,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734091900] [2023-11-29 03:09:27,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734091900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:27,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:27,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 03:09:27,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716237076] [2023-11-29 03:09:27,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:27,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 03:09:27,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:27,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 03:09:27,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:09:27,278 INFO L87 Difference]: Start difference. First operand 168 states and 198 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 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) [2023-11-29 03:09:28,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:28,884 INFO L93 Difference]: Finished difference Result 168 states and 198 transitions. [2023-11-29 03:09:28,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 03:09:28,884 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 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 21 [2023-11-29 03:09:28,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:28,885 INFO L225 Difference]: With dead ends: 168 [2023-11-29 03:09:28,886 INFO L226 Difference]: Without dead ends: 168 [2023-11-29 03:09:28,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2023-11-29 03:09:28,887 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 148 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:28,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 330 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 03:09:28,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-29 03:09:28,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 147. [2023-11-29 03:09:28,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 120 states have (on average 1.4083333333333334) internal successors, (169), 145 states have internal predecessors, (169), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:28,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 174 transitions. [2023-11-29 03:09:28,891 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 174 transitions. Word has length 21 [2023-11-29 03:09:28,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:28,892 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 174 transitions. [2023-11-29 03:09:28,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 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) [2023-11-29 03:09:28,892 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 174 transitions. [2023-11-29 03:09:28,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 03:09:28,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:28,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:28,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 03:09:29,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:29,093 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:29,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:29,094 INFO L85 PathProgramCache]: Analyzing trace with hash 944101404, now seen corresponding path program 1 times [2023-11-29 03:09:29,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:29,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258662494] [2023-11-29 03:09:29,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:29,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:29,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:29,095 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:29,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 03:09:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:29,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 03:09:29,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:29,226 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 [2023-11-29 03:09:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:29,295 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:29,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:29,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258662494] [2023-11-29 03:09:29,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258662494] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:29,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:29,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:09:29,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716271537] [2023-11-29 03:09:29,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:29,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:09:29,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:29,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:09:29,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:09:29,297 INFO L87 Difference]: Start difference. First operand 147 states and 174 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) [2023-11-29 03:09:29,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:29,790 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2023-11-29 03:09:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:09:29,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 [2023-11-29 03:09:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:29,791 INFO L225 Difference]: With dead ends: 153 [2023-11-29 03:09:29,791 INFO L226 Difference]: Without dead ends: 153 [2023-11-29 03:09:29,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:09:29,792 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 103 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:29,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 264 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:09:29,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-29 03:09:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2023-11-29 03:09:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 118 states have (on average 1.4067796610169492) internal successors, (166), 143 states have internal predecessors, (166), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 171 transitions. [2023-11-29 03:09:29,795 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 171 transitions. Word has length 23 [2023-11-29 03:09:29,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:29,795 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 171 transitions. [2023-11-29 03:09:29,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) [2023-11-29 03:09:29,796 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 171 transitions. [2023-11-29 03:09:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 03:09:29,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:29,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:29,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-11-29 03:09:29,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:29,997 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:29,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:29,997 INFO L85 PathProgramCache]: Analyzing trace with hash 603082545, now seen corresponding path program 1 times [2023-11-29 03:09:29,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:29,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524636190] [2023-11-29 03:09:29,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:29,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:29,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:29,998 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:30,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 03:09:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:30,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 03:09:30,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:30,216 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 [2023-11-29 03:09:30,221 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 [2023-11-29 03:09:30,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-29 03:09:30,257 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 27 treesize of output 11 [2023-11-29 03:09:30,300 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 15 treesize of output 7 [2023-11-29 03:09:30,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:30,316 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:30,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:30,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524636190] [2023-11-29 03:09:30,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524636190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:30,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:30,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:09:30,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358016000] [2023-11-29 03:09:30,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:30,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:09:30,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:30,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:09:30,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:09:30,318 INFO L87 Difference]: Start difference. First operand 145 states and 171 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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) [2023-11-29 03:09:30,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:30,731 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2023-11-29 03:09:30,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:09:30,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 24 [2023-11-29 03:09:30,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:30,733 INFO L225 Difference]: With dead ends: 145 [2023-11-29 03:09:30,733 INFO L226 Difference]: Without dead ends: 145 [2023-11-29 03:09:30,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:09:30,733 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 77 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:30,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 171 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:09:30,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-29 03:09:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2023-11-29 03:09:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 118 states have (on average 1.3983050847457628) internal successors, (165), 142 states have internal predecessors, (165), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2023-11-29 03:09:30,738 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 24 [2023-11-29 03:09:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:30,739 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2023-11-29 03:09:30,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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) [2023-11-29 03:09:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2023-11-29 03:09:30,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:09:30,740 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:30,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:30,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 03:09:30,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:30,944 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:30,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:30,944 INFO L85 PathProgramCache]: Analyzing trace with hash -316730170, now seen corresponding path program 1 times [2023-11-29 03:09:30,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:30,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22590229] [2023-11-29 03:09:30,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:30,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:30,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:30,946 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:30,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 03:09:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:31,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 03:09:31,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:31,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:09:31,173 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:09:31,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 03:09:31,227 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 03:09:31,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 03:09:31,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:09:31,300 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:09:31,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-29 03:09:31,310 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 24 treesize of output 12 [2023-11-29 03:09:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:31,338 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:31,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:31,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22590229] [2023-11-29 03:09:31,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22590229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:31,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:31,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:09:31,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56725824] [2023-11-29 03:09:31,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:31,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:09:31,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:31,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:09:31,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:09:31,340 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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) [2023-11-29 03:09:32,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:32,140 INFO L93 Difference]: Finished difference Result 164 states and 189 transitions. [2023-11-29 03:09:32,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:09:32,140 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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 26 [2023-11-29 03:09:32,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:32,141 INFO L225 Difference]: With dead ends: 164 [2023-11-29 03:09:32,141 INFO L226 Difference]: Without dead ends: 164 [2023-11-29 03:09:32,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2023-11-29 03:09:32,142 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 208 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:32,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 190 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:09:32,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-29 03:09:32,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2023-11-29 03:09:32,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.376) internal successors, (172), 149 states have internal predecessors, (172), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:32,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 176 transitions. [2023-11-29 03:09:32,147 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 176 transitions. Word has length 26 [2023-11-29 03:09:32,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:32,147 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 176 transitions. [2023-11-29 03:09:32,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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) [2023-11-29 03:09:32,148 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 176 transitions. [2023-11-29 03:09:32,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:09:32,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:32,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:32,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 03:09:32,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:32,349 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:32,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:32,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1208357173, now seen corresponding path program 1 times [2023-11-29 03:09:32,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:32,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525379997] [2023-11-29 03:09:32,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:32,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:32,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:32,350 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:32,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 03:09:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:32,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:09:32,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:32,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:09:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:09:32,500 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:32,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:32,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525379997] [2023-11-29 03:09:32,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525379997] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:32,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:32,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:09:32,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509916017] [2023-11-29 03:09:32,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:32,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:09:32,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:32,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:09:32,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:09:32,502 INFO L87 Difference]: Start difference. First operand 151 states and 176 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2023-11-29 03:09:32,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:32,754 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2023-11-29 03:09:32,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:09:32,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2023-11-29 03:09:32,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:32,756 INFO L225 Difference]: With dead ends: 147 [2023-11-29 03:09:32,756 INFO L226 Difference]: Without dead ends: 147 [2023-11-29 03:09:32,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:09:32,757 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:32,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 208 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:09:32,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-29 03:09:32,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2023-11-29 03:09:32,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.361344537815126) internal successors, (162), 143 states have internal predecessors, (162), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 166 transitions. [2023-11-29 03:09:32,761 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 166 transitions. Word has length 26 [2023-11-29 03:09:32,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:32,761 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 166 transitions. [2023-11-29 03:09:32,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2023-11-29 03:09:32,761 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 166 transitions. [2023-11-29 03:09:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:09:32,761 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:32,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:32,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-11-29 03:09:32,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:32,962 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:32,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:32,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1209023850, now seen corresponding path program 1 times [2023-11-29 03:09:32,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:32,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758674811] [2023-11-29 03:09:32,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:32,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:32,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:32,963 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:32,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-29 03:09:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:33,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:09:33,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:09:33,126 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:33,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:33,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758674811] [2023-11-29 03:09:33,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758674811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:33,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:33,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:09:33,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285948057] [2023-11-29 03:09:33,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:33,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:09:33,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:33,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:09:33,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:09:33,128 INFO L87 Difference]: Start difference. First operand 145 states and 166 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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) [2023-11-29 03:09:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:33,281 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2023-11-29 03:09:33,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:09:33,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2023-11-29 03:09:33,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:33,282 INFO L225 Difference]: With dead ends: 147 [2023-11-29 03:09:33,282 INFO L226 Difference]: Without dead ends: 147 [2023-11-29 03:09:33,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:09:33,283 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 48 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:33,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 96 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:09:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-29 03:09:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2023-11-29 03:09:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 121 states have (on average 1.3388429752066116) internal successors, (162), 145 states have internal predecessors, (162), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 166 transitions. [2023-11-29 03:09:33,286 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 166 transitions. Word has length 26 [2023-11-29 03:09:33,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:33,287 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 166 transitions. [2023-11-29 03:09:33,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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) [2023-11-29 03:09:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 166 transitions. [2023-11-29 03:09:33,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 03:09:33,287 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:33,287 INFO L195 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] [2023-11-29 03:09:33,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-11-29 03:09:33,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:33,492 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:33,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:33,492 INFO L85 PathProgramCache]: Analyzing trace with hash 434102536, now seen corresponding path program 1 times [2023-11-29 03:09:33,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:33,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520973356] [2023-11-29 03:09:33,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:33,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:33,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:33,494 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:33,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-11-29 03:09:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:33,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 03:09:33,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:33,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:09:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:33,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:09:33,919 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 03:09:33,919 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 19 treesize of output 19 [2023-11-29 03:09:33,931 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-29 03:09:33,931 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 20 treesize of output 12 [2023-11-29 03:09:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:33,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:33,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520973356] [2023-11-29 03:09:33,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520973356] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:09:33,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:09:33,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-11-29 03:09:33,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198370023] [2023-11-29 03:09:33,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:09:33,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 03:09:33,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:33,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 03:09:33,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:09:33,983 INFO L87 Difference]: Start difference. First operand 147 states and 166 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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) [2023-11-29 03:09:35,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:35,187 INFO L93 Difference]: Finished difference Result 208 states and 229 transitions. [2023-11-29 03:09:35,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:09:35,188 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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 29 [2023-11-29 03:09:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:35,189 INFO L225 Difference]: With dead ends: 208 [2023-11-29 03:09:35,189 INFO L226 Difference]: Without dead ends: 208 [2023-11-29 03:09:35,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:09:35,189 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 269 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:35,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 253 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 03:09:35,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-11-29 03:09:35,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 151. [2023-11-29 03:09:35,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.312) internal successors, (164), 149 states have internal predecessors, (164), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:35,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2023-11-29 03:09:35,193 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 29 [2023-11-29 03:09:35,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:35,193 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2023-11-29 03:09:35,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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) [2023-11-29 03:09:35,193 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2023-11-29 03:09:35,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 03:09:35,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:35,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:35,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-11-29 03:09:35,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:35,394 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:35,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:35,394 INFO L85 PathProgramCache]: Analyzing trace with hash 572276420, now seen corresponding path program 1 times [2023-11-29 03:09:35,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:35,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588055399] [2023-11-29 03:09:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:35,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:35,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:35,396 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:35,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-29 03:09:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:35,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:09:35,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 03:09:35,560 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:35,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:35,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588055399] [2023-11-29 03:09:35,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588055399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:35,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:35,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:09:35,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029924105] [2023-11-29 03:09:35,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:35,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:09:35,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:35,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:09:35,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:09:35,562 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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) [2023-11-29 03:09:35,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:35,717 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2023-11-29 03:09:35,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:09:35,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 30 [2023-11-29 03:09:35,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:35,718 INFO L225 Difference]: With dead ends: 150 [2023-11-29 03:09:35,718 INFO L226 Difference]: Without dead ends: 150 [2023-11-29 03:09:35,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:09:35,718 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 66 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:35,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 62 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:09:35,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-29 03:09:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2023-11-29 03:09:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 125 states have (on average 1.296) internal successors, (162), 148 states have internal predecessors, (162), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 166 transitions. [2023-11-29 03:09:35,722 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 166 transitions. Word has length 30 [2023-11-29 03:09:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:35,722 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 166 transitions. [2023-11-29 03:09:35,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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) [2023-11-29 03:09:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 166 transitions. [2023-11-29 03:09:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 03:09:35,722 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:35,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:35,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-11-29 03:09:35,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:35,923 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:35,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:35,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1313646286, now seen corresponding path program 1 times [2023-11-29 03:09:35,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:35,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191002949] [2023-11-29 03:09:35,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:35,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:35,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:35,925 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:35,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-11-29 03:09:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:36,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 03:09:36,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:36,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:09:36,268 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 03:09:36,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 03:09:36,289 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:09:36,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 03:09:36,311 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 15 treesize of output 1 [2023-11-29 03:09:36,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:09:36,355 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 03:09:36,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 03:09:36,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:09:36,425 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:09:36,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-29 03:09:36,433 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 24 treesize of output 12 [2023-11-29 03:09:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:36,456 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:36,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:36,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191002949] [2023-11-29 03:09:36,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191002949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:36,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:36,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:09:36,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900382577] [2023-11-29 03:09:36,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:36,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:09:36,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:36,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:09:36,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:09:36,458 INFO L87 Difference]: Start difference. First operand 150 states and 166 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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) [2023-11-29 03:09:37,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:37,367 INFO L93 Difference]: Finished difference Result 159 states and 175 transitions. [2023-11-29 03:09:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:09:37,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 32 [2023-11-29 03:09:37,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:37,369 INFO L225 Difference]: With dead ends: 159 [2023-11-29 03:09:37,369 INFO L226 Difference]: Without dead ends: 159 [2023-11-29 03:09:37,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:09:37,369 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 75 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:37,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 344 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:09:37,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-29 03:09:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 142. [2023-11-29 03:09:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 118 states have (on average 1.305084745762712) internal successors, (154), 140 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2023-11-29 03:09:37,374 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 32 [2023-11-29 03:09:37,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:37,374 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2023-11-29 03:09:37,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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) [2023-11-29 03:09:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2023-11-29 03:09:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 03:09:37,375 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:37,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:37,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-11-29 03:09:37,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:37,576 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:37,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:37,576 INFO L85 PathProgramCache]: Analyzing trace with hash 201836775, now seen corresponding path program 1 times [2023-11-29 03:09:37,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:37,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566060986] [2023-11-29 03:09:37,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:37,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:37,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:37,577 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:37,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-11-29 03:09:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:37,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 03:09:37,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:42,558 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~list~0#1.base_51| (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 1)) (v_DerPreprocessor_4 (_ BitVec 1)) (|ULTIMATE.start_main_~null~0#1.base| (_ BitVec 32))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~null~0#1.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~null~0#1.base| (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~null~0#1.base| (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~null~0#1.base| v_DerPreprocessor_5) |v_ULTIMATE.start_main_~list~0#1.base_51| (_ bv0 1)) |ULTIMATE.start_main_~null~0#1.base|)) |v_ULTIMATE.start_main_~list~0#1.base_51| v_DerPreprocessor_4) |ULTIMATE.start_main_~null~0#1.base|)) |v_ULTIMATE.start_main_~list~0#1.base_51|)) (not (= |v_ULTIMATE.start_main_~list~0#1.base_51| |ULTIMATE.start_main_~null~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~list~0#1.base_51| (_ bv0 1)) |ULTIMATE.start_main_~null~0#1.base| (_ bv0 1))))) is different from true [2023-11-29 03:09:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:42,559 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:09:50,845 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~list~0#1.base_52| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |v_ULTIMATE.start_main_~list~0#1.base_52| (_ bv0 1)) |c_ULTIMATE.start_main_~null~0#1.base| (_ bv0 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~list~0#1.base_52|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~null~0#1.base| |v_ULTIMATE.start_main_~list~0#1.base_52|))) (or (= |c_ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_main_~list~0#1.base_52| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |v_ULTIMATE.start_main_~list~0#1.base_52| (_ bv0 1)) |c_ULTIMATE.start_main_~null~0#1.base| (_ bv0 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~list~0#1.base_52|) (_ bv0 1))))))) is different from false [2023-11-29 03:09:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:50,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:50,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566060986] [2023-11-29 03:09:50,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566060986] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:09:50,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:09:50,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2023-11-29 03:09:50,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197674690] [2023-11-29 03:09:50,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:09:50,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 03:09:50,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:50,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 03:09:50,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=98, Unknown=4, NotChecked=42, Total=182 [2023-11-29 03:09:50,885 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:55,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:09:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:56,399 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2023-11-29 03:09:56,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:09:56,400 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-29 03:09:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:56,401 INFO L225 Difference]: With dead ends: 151 [2023-11-29 03:09:56,401 INFO L226 Difference]: Without dead ends: 128 [2023-11-29 03:09:56,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=81, Invalid=195, Unknown=4, NotChecked=62, Total=342 [2023-11-29 03:09:56,401 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 52 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:56,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 403 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 501 Invalid, 3 Unknown, 211 Unchecked, 5.2s Time] [2023-11-29 03:09:56,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-29 03:09:56,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-11-29 03:09:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 126 states have internal predecessors, (139), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:56,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2023-11-29 03:09:56,404 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 32 [2023-11-29 03:09:56,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:56,404 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2023-11-29 03:09:56,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:09:56,404 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2023-11-29 03:09:56,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 03:09:56,405 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:56,405 INFO L195 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] [2023-11-29 03:09:56,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-11-29 03:09:56,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:56,605 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:09:56,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:56,606 INFO L85 PathProgramCache]: Analyzing trace with hash -221680808, now seen corresponding path program 1 times [2023-11-29 03:09:56,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:09:56,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409953558] [2023-11-29 03:09:56,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:56,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:09:56,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:09:56,607 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:09:56,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-11-29 03:09:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:56,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 03:09:56,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:56,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:09:56,855 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 [2023-11-29 03:09:56,913 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:09:56,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:09:56,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:09:56,959 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 [2023-11-29 03:09:57,054 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:09:57,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 03:09:57,059 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 [2023-11-29 03:09:57,076 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 [2023-11-29 03:09:57,102 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 [2023-11-29 03:09:57,123 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 [2023-11-29 03:09:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:57,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:09:57,422 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1454) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1453) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1456) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 32))) is different from false [2023-11-29 03:09:57,434 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_1454) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1453) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1456)) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 32))) is different from false [2023-11-29 03:09:57,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:09:57,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2023-11-29 03:09:57,450 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 70 treesize of output 62 [2023-11-29 03:09:57,463 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 29 treesize of output 27 [2023-11-29 03:09:57,517 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse2 (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_#t~malloc4#1.base|))) (and (or (forall ((v_ArrVal_1456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1450 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1450)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1456) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))) .cse2) (forall ((v_ArrVal_1456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1454 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_1450 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1450)))) (or (= (select (select (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1454) v_arrayElimCell_74 v_ArrVal_1456) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= (select (select (store .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1456) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))) (or (forall ((v_ArrVal_1456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1454 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_1450 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1450)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1454) v_arrayElimCell_74 v_ArrVal_1456) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))) (not .cse2)))) is different from false [2023-11-29 03:09:57,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:09:57,873 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 2 case distinctions, treesize of input 54 treesize of output 46 [2023-11-29 03:09:57,877 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 165 treesize of output 141 [2023-11-29 03:09:57,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:09:57,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:09:57,895 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 03:09:57,895 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 03:09:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:09:57,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:09:57,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409953558] [2023-11-29 03:09:57,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409953558] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:09:57,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:09:57,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2023-11-29 03:09:57,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594045181] [2023-11-29 03:09:57,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:09:57,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 03:09:57,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:09:57,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 03:09:57,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=207, Unknown=11, NotChecked=96, Total=380 [2023-11-29 03:09:57,934 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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) [2023-11-29 03:09:59,099 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse3 (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_#t~malloc4#1.base|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_22| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_22|))) (forall ((v_ArrVal_1456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1454 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_1450 (_ BitVec 32))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1450)))) (or (= (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc4#1.base_22| v_ArrVal_1454) v_arrayElimCell_74 v_ArrVal_1456) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc4#1.base_22| v_ArrVal_1456) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))))) (or (forall ((v_ArrVal_1456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1450 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1450)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1456) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))) .cse3) (forall ((v_ArrVal_1456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1454 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_1450 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1450)))) (or (= (select (select (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1454) v_arrayElimCell_74 v_ArrVal_1456) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= (select (select (store .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1456) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|) (_ bv0 1))) (forall ((v_ArrVal_1456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1454 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1454) v_arrayElimCell_74 v_ArrVal_1456) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)))) (forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_22| (_ BitVec 32))) (or (forall ((v_ArrVal_1456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1450 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1450)) |v_ULTIMATE.start_main_#t~malloc4#1.base_22| v_ArrVal_1456) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_22|))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc4#1.base_22|))) (= (select .cse2 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv8 32))) (_ bv1 32)) (or (forall ((v_ArrVal_1456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1454 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_1450 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1450)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1454) v_arrayElimCell_74 v_ArrVal_1456) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))) (not .cse3)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (= (_ bv1 32) (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) (_ bv8 32))) (= |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))))) is different from false [2023-11-29 03:09:59,216 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (forall ((v_ArrVal_1456 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1456) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) (_ bv1 32)))) is different from false [2023-11-29 03:09:59,356 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|) (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv8 32))) (_ bv1 32)) (forall ((v_ArrVal_1456 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1456) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) (_ bv1 32)))) is different from false [2023-11-29 03:10:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:10:00,789 INFO L93 Difference]: Finished difference Result 338 states and 385 transitions. [2023-11-29 03:10:00,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 03:10:00,789 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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 [2023-11-29 03:10:00,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:10:00,791 INFO L225 Difference]: With dead ends: 338 [2023-11-29 03:10:00,791 INFO L226 Difference]: Without dead ends: 338 [2023-11-29 03:10:00,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=208, Invalid=612, Unknown=16, NotChecked=354, Total=1190 [2023-11-29 03:10:00,792 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 482 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 43 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 915 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:10:00,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 490 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 656 Invalid, 9 Unknown, 915 Unchecked, 2.3s Time] [2023-11-29 03:10:00,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-11-29 03:10:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 167. [2023-11-29 03:10:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 143 states have (on average 1.2727272727272727) internal successors, (182), 165 states have internal predecessors, (182), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:10:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 185 transitions. [2023-11-29 03:10:00,796 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 185 transitions. Word has length 34 [2023-11-29 03:10:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:10:00,796 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 185 transitions. [2023-11-29 03:10:00,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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) [2023-11-29 03:10:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 185 transitions. [2023-11-29 03:10:00,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 03:10:00,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:10:00,796 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:10:00,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2023-11-29 03:10:00,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:10:00,997 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:10:00,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:10:00,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1863293122, now seen corresponding path program 1 times [2023-11-29 03:10:00,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:10:00,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023192341] [2023-11-29 03:10:00,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:10:00,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:10:00,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:10:00,999 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:10:00,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-11-29 03:10:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:01,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 03:10:01,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:10:01,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:10:01,292 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:10:01,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:10:01,346 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 [2023-11-29 03:10:01,454 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:10:01,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:10:01,518 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:10:01,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-11-29 03:10:01,561 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:10:01,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:10:01,781 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 27 treesize of output 15 [2023-11-29 03:10:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:10:01,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:10:05,974 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1528) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2023-11-29 03:10:05,987 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1526))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1528)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2023-11-29 03:10:06,002 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1526))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1528)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 1)))) is different from false [2023-11-29 03:10:06,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:06,013 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 40 treesize of output 33 [2023-11-29 03:10:06,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:06,033 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 268 treesize of output 243 [2023-11-29 03:10:06,045 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 187 treesize of output 179 [2023-11-29 03:10:06,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:06,065 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 179 treesize of output 175 [2023-11-29 03:10:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:10:27,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:10:27,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023192341] [2023-11-29 03:10:27,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023192341] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:10:27,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:10:27,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-11-29 03:10:27,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682826298] [2023-11-29 03:10:27,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:10:27,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 03:10:27,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:10:27,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 03:10:27,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=223, Unknown=8, NotChecked=102, Total=420 [2023-11-29 03:10:27,878 INFO L87 Difference]: Start difference. First operand 167 states and 185 transitions. Second operand has 21 states, 20 states have (on average 3.65) internal successors, (73), 21 states have internal predecessors, (73), 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) [2023-11-29 03:10:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:10:34,749 INFO L93 Difference]: Finished difference Result 279 states and 314 transitions. [2023-11-29 03:10:34,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:10:34,750 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.65) internal successors, (73), 21 states have internal predecessors, (73), 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 38 [2023-11-29 03:10:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:10:34,751 INFO L225 Difference]: With dead ends: 279 [2023-11-29 03:10:34,751 INFO L226 Difference]: Without dead ends: 279 [2023-11-29 03:10:34,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=148, Invalid=406, Unknown=10, NotChecked=138, Total=702 [2023-11-29 03:10:34,752 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 587 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 91 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 753 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:10:34,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 320 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 721 Invalid, 12 Unknown, 753 Unchecked, 2.6s Time] [2023-11-29 03:10:34,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-11-29 03:10:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 215. [2023-11-29 03:10:34,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 191 states have (on average 1.3141361256544504) internal successors, (251), 213 states have internal predecessors, (251), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:10:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 254 transitions. [2023-11-29 03:10:34,757 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 254 transitions. Word has length 38 [2023-11-29 03:10:34,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:10:34,757 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 254 transitions. [2023-11-29 03:10:34,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.65) internal successors, (73), 21 states have internal predecessors, (73), 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) [2023-11-29 03:10:34,757 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 254 transitions. [2023-11-29 03:10:34,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 03:10:34,758 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:10:34,758 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:10:34,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-11-29 03:10:34,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:10:34,958 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:10:34,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:10:34,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1863293121, now seen corresponding path program 1 times [2023-11-29 03:10:34,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:10:34,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008069318] [2023-11-29 03:10:34,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:10:34,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:10:34,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:10:34,960 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:10:34,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-11-29 03:10:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:35,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 03:10:35,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:10:35,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:10:35,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:10:35,252 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:10:35,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:10:35,296 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 [2023-11-29 03:10:35,301 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 [2023-11-29 03:10:35,428 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:10:35,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-11-29 03:10:35,437 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 [2023-11-29 03:10:35,506 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:10:35,506 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2023-11-29 03:10:35,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:10:35,523 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 [2023-11-29 03:10:35,560 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:10:35,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-11-29 03:10:35,568 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 [2023-11-29 03:10:35,827 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 [2023-11-29 03:10:35,835 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 [2023-11-29 03:10:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:10:35,866 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:10:36,276 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1604) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_1603 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1604 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1604) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1603) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2023-11-29 03:10:36,335 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1604) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_1603 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1604 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1604) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1603) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) is different from false [2023-11-29 03:10:36,469 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1603 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1599))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1600) .cse0 v_ArrVal_1604) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1603) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (forall ((v_ArrVal_1599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1600) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1599) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1604) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))) is different from false [2023-11-29 03:10:36,601 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1600) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1599) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1604) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_1599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1603 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1599))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1600) .cse2 v_ArrVal_1604) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1603) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))))) is different from false [2023-11-29 03:10:36,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:36,625 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 73 treesize of output 74 [2023-11-29 03:10:36,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:36,637 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 65 treesize of output 50 [2023-11-29 03:10:36,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:36,671 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 632 treesize of output 567 [2023-11-29 03:10:36,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:36,734 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 1127 treesize of output 1070 [2023-11-29 03:10:36,770 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 547 treesize of output 523 [2023-11-29 03:10:36,791 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 523 treesize of output 499 [2023-11-29 03:10:36,804 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 499 treesize of output 491 [2023-11-29 03:10:36,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:36,846 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 491 treesize of output 447 [2023-11-29 03:10:39,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:39,636 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 73 treesize of output 66 [2023-11-29 03:10:39,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:39,650 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 57 treesize of output 50 [2023-11-29 03:10:39,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 72 [2023-11-29 03:10:39,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:39,706 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 140 treesize of output 131 [2023-11-29 03:10:39,721 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 82 treesize of output 74 [2023-11-29 03:10:39,736 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 74 treesize of output 70 [2023-11-29 03:10:39,744 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 104 treesize of output 92 [2023-11-29 03:10:40,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:10:40,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:10:40,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008069318] [2023-11-29 03:10:40,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008069318] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:10:40,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:10:40,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2023-11-29 03:10:40,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133102786] [2023-11-29 03:10:40,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:10:40,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 03:10:40,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:10:40,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 03:10:40,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=197, Unknown=4, NotChecked=124, Total=380 [2023-11-29 03:10:40,073 INFO L87 Difference]: Start difference. First operand 215 states and 254 transitions. Second operand has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 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) [2023-11-29 03:10:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:10:43,336 INFO L93 Difference]: Finished difference Result 264 states and 296 transitions. [2023-11-29 03:10:43,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:10:43,337 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 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 38 [2023-11-29 03:10:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:10:43,339 INFO L225 Difference]: With dead ends: 264 [2023-11-29 03:10:43,339 INFO L226 Difference]: Without dead ends: 264 [2023-11-29 03:10:43,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=160, Invalid=554, Unknown=4, NotChecked=212, Total=930 [2023-11-29 03:10:43,340 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 436 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 872 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:10:43,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 385 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 796 Invalid, 0 Unknown, 872 Unchecked, 2.5s Time] [2023-11-29 03:10:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-11-29 03:10:43,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 215. [2023-11-29 03:10:43,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 213 states have internal predecessors, (249), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:10:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 252 transitions. [2023-11-29 03:10:43,344 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 252 transitions. Word has length 38 [2023-11-29 03:10:43,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:10:43,344 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 252 transitions. [2023-11-29 03:10:43,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 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) [2023-11-29 03:10:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 252 transitions. [2023-11-29 03:10:43,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 03:10:43,345 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:10:43,345 INFO L195 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, 1, 1, 1, 1] [2023-11-29 03:10:43,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-11-29 03:10:43,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:10:43,546 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:10:43,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:10:43,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1648852028, now seen corresponding path program 1 times [2023-11-29 03:10:43,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:10:43,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388151851] [2023-11-29 03:10:43,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:10:43,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:10:43,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:10:43,547 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:10:43,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-11-29 03:10:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:43,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 03:10:43,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:10:43,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:10:43,892 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 [2023-11-29 03:10:43,965 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:10:43,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:10:44,035 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 [2023-11-29 03:10:44,044 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 [2023-11-29 03:10:44,189 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:10:44,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-11-29 03:10:44,198 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 [2023-11-29 03:10:44,224 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 27 treesize of output 15 [2023-11-29 03:10:44,272 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 [2023-11-29 03:10:44,327 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-29 03:10:44,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 03:10:44,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 03:10:44,381 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 16 treesize of output 11 [2023-11-29 03:10:44,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2023-11-29 03:10:44,512 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:10:44,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2023-11-29 03:10:44,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:10:44,549 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 24 treesize of output 12 [2023-11-29 03:10:44,582 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 [2023-11-29 03:10:44,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 03:10:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:10:44,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:10:44,827 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 32))) is different from false [2023-11-29 03:10:44,843 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 32))) is different from false [2023-11-29 03:10:44,857 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1712 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1711) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1712) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 32))) is different from false [2023-11-29 03:10:44,870 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1712 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_1711) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1712) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1714)) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 32))) is different from false [2023-11-29 03:10:44,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:44,881 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 33 treesize of output 34 [2023-11-29 03:10:44,885 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 60 treesize of output 52 [2023-11-29 03:10:44,891 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 24 treesize of output 22 [2023-11-29 03:10:45,751 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (forall ((v_ArrVal_1704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1704) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1705) .cse0 v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))) (not (= (_ bv0 1) (select |c_#valid| .cse0)))))) (forall ((v_ArrVal_1704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (forall ((v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1705) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1704) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1710))) (or (= (select (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (forall ((v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (= (select (select (store (store .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)))))))) (forall ((v_ArrVal_1704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1704) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1705) .cse3 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| .cse3) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1)))))))) is different from false [2023-11-29 03:10:46,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:46,129 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 60 treesize of output 52 [2023-11-29 03:10:46,134 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 97 treesize of output 85 [2023-11-29 03:10:46,144 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 42 treesize of output 38 [2023-11-29 03:10:46,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:46,496 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 86 treesize of output 78 [2023-11-29 03:10:46,502 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 149 treesize of output 137 [2023-11-29 03:10:46,514 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 68 treesize of output 64 [2023-11-29 03:10:46,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:46,904 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 63 treesize of output 55 [2023-11-29 03:10:46,908 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 104 treesize of output 92 [2023-11-29 03:10:46,918 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 57 treesize of output 53 [2023-11-29 03:10:51,127 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1)))) (let ((.cse10 (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_#t~malloc4#1.base|))) (let ((.cse11 (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc4#1.base|) (_ bv0 1)))) (.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse4 (not .cse10))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (forall ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710))) (or (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_136 (_ BitVec 32))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_136 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))) (= (select (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (forall ((v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (= (select (select (store (store .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))))))) (or .cse4 (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_arrayElimCell_134 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_arrayElimCell_134) (forall ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (or (= (select (select (store (store .cse5 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store .cse5 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_134 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (forall ((v_arrayElimCell_134 (_ BitVec 32)) (v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_arrayElimCell_134) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_134 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)))))))) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (let ((.cse6 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_136 v_ArrVal_1710))) (or (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= (select (select (store .cse6 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (or (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_136 (_ BitVec 32))) (= (select (select (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_136 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))) (= (select (select (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1)))))) .cse4) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_arrayElimCell_134 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_arrayElimCell_134) (forall ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (or (= (select (select (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_134 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| |c_ULTIMATE.start_main_#t~malloc4#1.base|))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32)) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (let ((.cse9 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710))) (or (= (select (select (store .cse9 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (= (select (select (store (store .cse9 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))) .cse10) (or (forall ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))) .cse11) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32)) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| |c_ULTIMATE.start_main_#t~malloc4#1.base|))) .cse10) (or .cse4 (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1701 (_ BitVec 32)) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_138 v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (not (= (select |c_#valid| v_arrayElimCell_138) (_ bv0 1)))))) (or .cse4 (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_136 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32)) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (let ((.cse13 (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_136 v_ArrVal_1710))) (or (= (select (select (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (= (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= (select (select (store .cse13 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))))) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| |c_ULTIMATE.start_main_#t~malloc4#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_arrayElimCell_134 (_ BitVec 32)) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (or (= (select (select (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_134 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) .cse10) (or .cse4 (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1701 (_ BitVec 32)) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (or (= (select (select (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_138 v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (not (= (select |c_#valid| v_arrayElimCell_138) (_ bv0 1))))))) (or (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1701 (_ BitVec 32)) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (or (= (select (select (store (store .cse16 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= (select (select (store (store (store .cse16 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_138 v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))) .cse11) (or (forall ((v_arrayElimCell_134 (_ BitVec 32)) (v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32)) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_arrayElimCell_134) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_134 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)))) .cse4))))) is different from true [2023-11-29 03:10:55,723 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|) (_ bv0 1)))) (.cse9 (store |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base| (_ bv1 1))) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_28| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_28| (_ bv1 1)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_28|) (_ bv0 1))) (not (= (_ bv0 1) (bvadd (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_#t~malloc4#1.base_28| v_ArrVal_1710))) (or (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (= (select (select (store (store .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32))) (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_136 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store .cse3 |v_ULTIMATE.start_main_#t~malloc4#1.base_28| v_ArrVal_1705) v_arrayElimCell_136 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_22|)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_28| (_ BitVec 32))) (let ((.cse5 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_28| (_ bv1 1)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_28|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc4#1.base_28|) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32)) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |v_ULTIMATE.start_main_#t~malloc4#1.base_28| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_#t~malloc8#1.base_22|))))) (not (= (_ bv0 1) (bvadd (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_28| (_ BitVec 32))) (let ((.cse7 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_28| (_ bv1 1)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_28|) (_ bv0 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_arrayElimCell_134 (_ BitVec 32))) (or (forall ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (or (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc4#1.base_28| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc4#1.base_28| v_ArrVal_1705) v_arrayElimCell_134 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)))))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_arrayElimCell_134))) (not (= (_ bv0 1) (select .cse7 |v_ULTIMATE.start_main_#t~malloc8#1.base_22|))))) (not (= (_ bv0 1) (bvadd (select .cse7 |c_ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))))))) (or .cse8 (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (not (= (_ bv0 1) (select .cse9 v_arrayElimCell_138))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1705) v_arrayElimCell_138 v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_28| (_ BitVec 32))) (let ((.cse11 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_28| (_ bv1 1)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_28|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc4#1.base_28|) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32)) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (let ((.cse10 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |v_ULTIMATE.start_main_#t~malloc4#1.base_28| v_ArrVal_1710))) (or (= (select (select (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store .cse10 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (not (= (_ bv0 1) (select .cse11 |v_ULTIMATE.start_main_#t~malloc8#1.base_22|)))))) (not (= (_ bv0 1) (bvadd (select .cse11 |c_ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))))))) (or .cse8 (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse9 v_arrayElimCell_138))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1705) v_arrayElimCell_138 v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_28| (_ BitVec 32))) (let ((.cse12 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_28| (_ bv1 1)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_28|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc4#1.base_28|) (not (= (_ bv0 1) (bvadd (select .cse12 |c_ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |v_ULTIMATE.start_main_#t~malloc4#1.base_28| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32))) (not (= (_ bv0 1) (select .cse12 |v_ULTIMATE.start_main_#t~malloc8#1.base_22|)))))))) (or .cse8 (forall ((v_arrayElimCell_134 (_ BitVec 32)) (v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_arrayElimCell_134) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1705) v_arrayElimCell_134 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (not (= (select .cse9 |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1)))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_arrayElimCell_134 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_arrayElimCell_134) (forall ((v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1705) v_arrayElimCell_134 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32))))))) (not (= (select .cse9 |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (not (= (select .cse9 |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (forall ((v_arrayElimCell_134 (_ BitVec 32)) (v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_arrayElimCell_134) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1705) v_arrayElimCell_134 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)))))))) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (let ((.cse13 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1705) v_arrayElimCell_136 v_ArrVal_1710))) (or (= (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse13 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (not (= (select .cse9 |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (or (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_136 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1705) v_arrayElimCell_136 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)))) (not (= (select .cse9 |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1)))))) .cse8) (or .cse8 (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_136 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (let ((.cse14 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1705) v_arrayElimCell_136 v_ArrVal_1710))) (or (= (select (select (store (store .cse14 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse14 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (not (= (select .cse9 |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_28| (_ BitVec 32))) (let ((.cse15 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_28| (_ bv1 1)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_28|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc4#1.base_28|) (not (= (_ bv0 1) (bvadd (select .cse15 |c_ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_arrayElimCell_134 (_ BitVec 32)) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (or (= (select (select (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc4#1.base_28| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc4#1.base_28| v_ArrVal_1705) v_arrayElimCell_134 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)))))) (not (= (_ bv0 1) (select .cse15 |v_ULTIMATE.start_main_#t~malloc8#1.base_22|)))))))))) is different from true [2023-11-29 03:10:56,346 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:10:56,353 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 [2023-11-29 03:10:56,359 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 [2023-11-29 03:10:56,367 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:10:56,374 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 [2023-11-29 03:10:56,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:10:56,387 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:10:56,396 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 [2023-11-29 03:10:56,402 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 [2023-11-29 03:10:56,407 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 [2023-11-29 03:10:56,427 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 03:10:56,427 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 1 [2023-11-29 03:10:56,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:56,456 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 2 case distinctions, treesize of input 91 treesize of output 70 [2023-11-29 03:10:56,463 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:10:56,466 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 154 treesize of output 130 [2023-11-29 03:10:56,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:10:56,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:10:56,490 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 03:10:56,490 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2023-11-29 03:10:56,493 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:10:56,499 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 [2023-11-29 03:10:56,503 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 [2023-11-29 03:10:56,520 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 03:10:56,521 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2023-11-29 03:10:56,526 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:10:56,538 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 28 treesize of output 20 [2023-11-29 03:10:56,543 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 29 treesize of output 21 [2023-11-29 03:10:56,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:10:56,556 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:10:56,563 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 [2023-11-29 03:10:56,570 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 [2023-11-29 03:10:56,576 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 24 treesize of output 16 [2023-11-29 03:10:56,586 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:10:56,599 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 42 treesize of output 34 [2023-11-29 03:10:56,606 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 37 treesize of output 29 [2023-11-29 03:10:56,612 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 28 treesize of output 20 [2023-11-29 03:10:56,641 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 03:10:56,641 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 1 [2023-11-29 03:10:56,647 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:10:56,653 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 [2023-11-29 03:10:56,658 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 [2023-11-29 03:10:56,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:56,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 52 [2023-11-29 03:10:56,693 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:10:56,699 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 95 treesize of output 77 [2023-11-29 03:10:56,709 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 [2023-11-29 03:10:56,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:10:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 03:10:56,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:10:56,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388151851] [2023-11-29 03:10:56,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388151851] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:10:56,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:10:56,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2023-11-29 03:10:56,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553306331] [2023-11-29 03:10:56,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:10:56,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 03:10:56,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:10:56,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 03:10:56,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=360, Unknown=19, NotChecked=322, Total=812 [2023-11-29 03:10:56,976 INFO L87 Difference]: Start difference. First operand 215 states and 252 transitions. Second operand has 29 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 states have internal predecessors, (72), 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) [2023-11-29 03:11:05,913 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc4#1.base|))) (and (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_#t~malloc4#1.base|)) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv1 32) (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) (_ bv8 32))) (= |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))) (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) (or (not (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1)))) (let ((.cse11 (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_#t~malloc4#1.base|))) (let ((.cse12 (not (= .cse0 (_ bv0 1)))) (.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse5 (not .cse11))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (forall ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710))) (or (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_136 (_ BitVec 32))) (= (select (select (store (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_136 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32))) (= (select (select (store .cse3 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (= (select (select (store (store .cse3 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32))))))))) (or .cse5 (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_arrayElimCell_134 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_arrayElimCell_134) (forall ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (or (= (select (select (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_134 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (forall ((v_arrayElimCell_134 (_ BitVec 32)) (v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_arrayElimCell_134) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_134 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)))))))) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (let ((.cse7 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_136 v_ArrVal_1710))) (or (= (select (select (store (store .cse7 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (or (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_136 (_ BitVec 32))) (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_136 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32))) (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1)))))) .cse5) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_arrayElimCell_134 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_arrayElimCell_134) (forall ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (or (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_134 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| |c_ULTIMATE.start_main_#t~malloc4#1.base|))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32)) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (let ((.cse10 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710))) (or (= (select (select (store .cse10 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (= (select (select (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32))))) .cse11) (or (forall ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32))) .cse12) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32)) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| |c_ULTIMATE.start_main_#t~malloc4#1.base|))) .cse11) (or .cse5 (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1701 (_ BitVec 32)) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_138 v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (not (= (select |c_#valid| v_arrayElimCell_138) (_ bv0 1)))))) (or .cse5 (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_136 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32)) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (let ((.cse14 (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_136 v_ArrVal_1710))) (or (= (select (select (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (= (select (select (store (store .cse14 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store .cse14 |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32))))))) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| |c_ULTIMATE.start_main_#t~malloc4#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32))) (or (forall ((v_arrayElimCell_134 (_ BitVec 32)) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (or (= (select (select (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_134 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) .cse11) (or .cse5 (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1701 (_ BitVec 32)) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (or (= (select (select (store (store .cse16 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store (store .cse16 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_138 v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (not (= (select |c_#valid| v_arrayElimCell_138) (_ bv0 1))))))) (or (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1701 (_ BitVec 32)) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1711 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_132 (_ BitVec 32))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)))) (or (= (select (select (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_138 v_ArrVal_1711) v_arrayElimCell_132 v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32))))) .cse12) (or (forall ((v_arrayElimCell_134 (_ BitVec 32)) (v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc8#1.base_22| (_ BitVec 32)) (v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_22|) (_ bv0 1))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_arrayElimCell_134) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1701)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1705) v_arrayElimCell_134 v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc8#1.base_22| v_ArrVal_1714) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)))) .cse5))))))) is different from true [2023-11-29 03:11:17,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:11:21,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:11:25,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:11:29,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:11:34,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:11:38,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:11:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:40,536 INFO L93 Difference]: Finished difference Result 305 states and 355 transitions. [2023-11-29 03:11:40,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 03:11:40,537 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 states have internal predecessors, (72), 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 40 [2023-11-29 03:11:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:40,538 INFO L225 Difference]: With dead ends: 305 [2023-11-29 03:11:40,538 INFO L226 Difference]: Without dead ends: 305 [2023-11-29 03:11:40,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=240, Invalid=889, Unknown=25, NotChecked=568, Total=1722 [2023-11-29 03:11:40,540 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 328 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 45 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 1406 IncrementalHoareTripleChecker+Unchecked, 26.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:40,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 453 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 795 Invalid, 13 Unknown, 1406 Unchecked, 26.7s Time] [2023-11-29 03:11:40,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-11-29 03:11:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 222. [2023-11-29 03:11:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 198 states have (on average 1.292929292929293) internal successors, (256), 220 states have internal predecessors, (256), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:11:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 259 transitions. [2023-11-29 03:11:40,545 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 259 transitions. Word has length 40 [2023-11-29 03:11:40,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:40,545 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 259 transitions. [2023-11-29 03:11:40,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 states have internal predecessors, (72), 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) [2023-11-29 03:11:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 259 transitions. [2023-11-29 03:11:40,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 03:11:40,546 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:40,546 INFO L195 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, 1, 1, 1, 1] [2023-11-29 03:11:40,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-11-29 03:11:40,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:11:40,747 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:11:40,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:40,747 INFO L85 PathProgramCache]: Analyzing trace with hash -874099933, now seen corresponding path program 1 times [2023-11-29 03:11:40,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:11:40,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281204896] [2023-11-29 03:11:40,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:40,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:11:40,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:11:40,749 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:11:40,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-11-29 03:11:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:40,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:11:40,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:11:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 03:11:40,976 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:11:40,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:11:40,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281204896] [2023-11-29 03:11:40,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281204896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:40,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:40,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:11:40,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169978396] [2023-11-29 03:11:40,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:40,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:11:40,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:11:40,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:11:40,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:11:40,978 INFO L87 Difference]: Start difference. First operand 222 states and 259 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) [2023-11-29 03:11:41,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:41,538 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2023-11-29 03:11:41,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:11:41,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 40 [2023-11-29 03:11:41,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:41,540 INFO L225 Difference]: With dead ends: 215 [2023-11-29 03:11:41,541 INFO L226 Difference]: Without dead ends: 215 [2023-11-29 03:11:41,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:11:41,541 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 14 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:41,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 227 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:11:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-29 03:11:41,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2023-11-29 03:11:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 191 states have (on average 1.2827225130890052) internal successors, (245), 213 states have internal predecessors, (245), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:11:41,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2023-11-29 03:11:41,547 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 40 [2023-11-29 03:11:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:41,547 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2023-11-29 03:11:41,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) [2023-11-29 03:11:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2023-11-29 03:11:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 03:11:41,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:41,548 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:41,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2023-11-29 03:11:41,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:11:41,748 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:11:41,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:41,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1211603154, now seen corresponding path program 2 times [2023-11-29 03:11:41,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:11:41,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555936301] [2023-11-29 03:11:41,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:11:41,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:11:41,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:11:41,750 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:11:41,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-11-29 03:11:42,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:11:42,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:11:42,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 03:11:42,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:11:42,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:11:42,068 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:11:42,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:11:42,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:11:42,181 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:11:42,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-29 03:11:42,244 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:11:42,244 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2023-11-29 03:11:42,253 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 5 treesize of output 3 [2023-11-29 03:11:42,275 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:11:42,275 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2023-11-29 03:11:42,330 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:11:42,331 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2023-11-29 03:11:42,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:11:42,345 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 [2023-11-29 03:11:42,947 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-29 03:11:42,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2023-11-29 03:11:42,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2023-11-29 03:11:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:11:42,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:11:43,526 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1853))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select v_ArrVal_1853 |c_ULTIMATE.start_main_~end~0#1.offset|))) (forall ((v_ArrVal_1852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select v_ArrVal_1852 |c_ULTIMATE.start_main_~end~0#1.offset|) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1852))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1853) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) is different from false [2023-11-29 03:11:43,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:11:43,576 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 86 treesize of output 85 [2023-11-29 03:11:43,584 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 37 treesize of output 35 [2023-11-29 03:11:43,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:11:43,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 241 [2023-11-29 03:11:43,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:11:43,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 182 treesize of output 214 [2023-11-29 03:12:02,888 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1849 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1849) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |c_ULTIMATE.start_main_~list~0#1.base|))) (= |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) is different from false [2023-11-29 03:12:02,908 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1849 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1849) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) is different from false [2023-11-29 03:12:02,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:12:02,932 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 19 treesize of output 20 [2023-11-29 03:12:02,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-29 03:12:02,942 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 6 treesize of output 4 [2023-11-29 03:12:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:12:03,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:12:03,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555936301] [2023-11-29 03:12:03,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555936301] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:12:03,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:12:03,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 22 [2023-11-29 03:12:03,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037570774] [2023-11-29 03:12:03,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:12:03,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 03:12:03,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:12:03,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 03:12:03,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=301, Unknown=3, NotChecked=108, Total=462 [2023-11-29 03:12:03,099 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 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) [2023-11-29 03:12:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:12:09,253 INFO L93 Difference]: Finished difference Result 303 states and 330 transitions. [2023-11-29 03:12:09,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 03:12:09,254 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 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 42 [2023-11-29 03:12:09,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:12:09,255 INFO L225 Difference]: With dead ends: 303 [2023-11-29 03:12:09,255 INFO L226 Difference]: Without dead ends: 303 [2023-11-29 03:12:09,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=258, Invalid=1311, Unknown=3, NotChecked=234, Total=1806 [2023-11-29 03:12:09,257 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 635 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 793 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:12:09,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 452 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1246 Invalid, 0 Unknown, 793 Unchecked, 4.3s Time] [2023-11-29 03:12:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-11-29 03:12:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 207. [2023-11-29 03:12:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 183 states have (on average 1.2404371584699454) internal successors, (227), 205 states have internal predecessors, (227), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:12:09,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 230 transitions. [2023-11-29 03:12:09,262 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 230 transitions. Word has length 42 [2023-11-29 03:12:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:12:09,262 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 230 transitions. [2023-11-29 03:12:09,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 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) [2023-11-29 03:12:09,262 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 230 transitions. [2023-11-29 03:12:09,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 03:12:09,263 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:12:09,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:12:09,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-11-29 03:12:09,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:12:09,463 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:12:09,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:12:09,464 INFO L85 PathProgramCache]: Analyzing trace with hash -836278345, now seen corresponding path program 1 times [2023-11-29 03:12:09,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:12:09,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499985701] [2023-11-29 03:12:09,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:12:09,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:12:09,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:12:09,465 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:12:09,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-11-29 03:12:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:09,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 03:12:09,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:12:09,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:12:09,805 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:12:09,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:12:09,849 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 [2023-11-29 03:12:09,863 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 [2023-11-29 03:12:09,999 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:12:09,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 03:12:10,005 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 [2023-11-29 03:12:10,100 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:12:10,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 03:12:10,113 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 5 treesize of output 3 [2023-11-29 03:12:10,140 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:12:10,141 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2023-11-29 03:12:10,219 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:12:10,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2023-11-29 03:12:10,224 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 [2023-11-29 03:12:10,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 03:12:10,601 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 27 treesize of output 15 [2023-11-29 03:12:10,607 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 [2023-11-29 03:12:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:12:10,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:12:11,024 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 46 treesize of output 26 [2023-11-29 03:12:11,352 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1924))) (= (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1923) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1928) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1923))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= .cse1 (select (select (store .cse2 .cse1 v_ArrVal_1927) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) is different from false [2023-11-29 03:12:11,381 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1923))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_1927) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1)))) (forall ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1924))) (= (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1923) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1928) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)))))) is different from false [2023-11-29 03:12:11,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:12:11,400 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 51 treesize of output 36 [2023-11-29 03:12:11,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:12:11,421 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 408 treesize of output 343 [2023-11-29 03:12:11,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:12:11,450 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 287 treesize of output 263 [2023-11-29 03:12:11,458 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 255 treesize of output 239 [2023-11-29 03:12:11,694 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:12:11,694 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2023-11-29 03:12:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:12:15,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:12:15,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499985701] [2023-11-29 03:12:15,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499985701] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:12:15,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:12:15,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-11-29 03:12:15,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629447434] [2023-11-29 03:12:15,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:12:15,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 03:12:15,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:12:15,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 03:12:15,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=317, Unknown=18, NotChecked=74, Total=462 [2023-11-29 03:12:15,884 INFO L87 Difference]: Start difference. First operand 207 states and 230 transitions. Second operand has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 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) [2023-11-29 03:12:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:12:20,197 INFO L93 Difference]: Finished difference Result 233 states and 256 transitions. [2023-11-29 03:12:20,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:12:20,198 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 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 44 [2023-11-29 03:12:20,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:12:20,199 INFO L225 Difference]: With dead ends: 233 [2023-11-29 03:12:20,199 INFO L226 Difference]: Without dead ends: 233 [2023-11-29 03:12:20,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=163, Invalid=815, Unknown=22, NotChecked=122, Total=1122 [2023-11-29 03:12:20,200 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 288 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:12:20,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 597 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1077 Invalid, 0 Unknown, 358 Unchecked, 3.5s Time] [2023-11-29 03:12:20,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-11-29 03:12:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 205. [2023-11-29 03:12:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 181 states have (on average 1.2375690607734806) internal successors, (224), 203 states have internal predecessors, (224), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:12:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 227 transitions. [2023-11-29 03:12:20,205 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 227 transitions. Word has length 44 [2023-11-29 03:12:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:12:20,205 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 227 transitions. [2023-11-29 03:12:20,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 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) [2023-11-29 03:12:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 227 transitions. [2023-11-29 03:12:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 03:12:20,206 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:12:20,206 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:12:20,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2023-11-29 03:12:20,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:12:20,407 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2023-11-29 03:12:20,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:12:20,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2071631446, now seen corresponding path program 1 times [2023-11-29 03:12:20,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:12:20,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747909189] [2023-11-29 03:12:20,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:12:20,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:12:20,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:12:20,408 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:12:20,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53131f3d-ae87-4e97-9a90-55c29e4386d2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-11-29 03:12:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:20,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 03:12:20,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:12:20,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:12:20,786 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:12:20,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:12:20,845 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 [2023-11-29 03:12:20,955 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:12:20,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:12:21,026 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:12:21,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-11-29 03:12:21,075 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:12:21,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-11-29 03:12:21,104 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-29 03:12:21,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-11-29 03:12:21,174 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 03:12:21,174 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 43 treesize of output 23 [2023-11-29 03:12:21,337 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 03:12:21,337 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 52 treesize of output 50 [2023-11-29 03:12:21,524 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 03:12:21,524 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 67 treesize of output 50 [2023-11-29 03:12:21,587 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 03:12:21,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 59 [2023-11-29 03:12:22,000 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:12:22,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2023-11-29 03:12:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:12:22,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:12:26,238 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2033) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:12:26,253 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2031))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2033)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:12:26,275 INFO L349 Elim1Store]: treesize reduction 7, result has 80.0 percent of original size [2023-11-29 03:12:26,275 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 41 treesize of output 40 [2023-11-29 03:12:26,284 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~end~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2031))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2033)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) is different from false [2023-11-29 03:12:26,297 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2033 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~end~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc8#1.base|)) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2031))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2033)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) is different from false [2023-11-29 03:12:26,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:12:26,312 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2023-11-29 03:12:26,329 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2033 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_22 |ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| .cse0))) (= (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_22) .cse0 v_ArrVal_2031))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2033)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_ULTIMATE.start_main_~end~0#1.base|)))) is different from false [2023-11-29 03:12:26,381 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.offset_158| (_ BitVec 32)) (v_ArrVal_2033 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select v_arrayElimArr_22 |v_ULTIMATE.start_main_~end~0#1.offset_158|))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_22) .cse2 v_ArrVal_2031))) (store .cse1 (select (select .cse1 .cse0) |v_ULTIMATE.start_main_~end~0#1.offset_158|) v_ArrVal_2033)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse2)))))) is different from false [2023-11-29 03:12:26,407 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.offset_158| (_ BitVec 32)) (v_ArrVal_2033 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2026 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select v_arrayElimArr_22 |v_ULTIMATE.start_main_~end~0#1.offset_158|))) (or (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2026))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select (let ((.cse0 (store (store .cse2 .cse1 v_arrayElimArr_22) .cse3 v_ArrVal_2031))) (store .cse0 (select (select .cse0 .cse1) |v_ULTIMATE.start_main_~end~0#1.offset_158|) v_ArrVal_2033)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1))) (not (= (_ bv0 1) (select |c_#valid| .cse3)))))) is different from false [2023-11-29 03:12:26,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:12:26,530 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 112 treesize of output 73 [2023-11-29 03:12:26,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:12:26,573 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 12686 treesize of output 10901 [2023-11-29 03:12:27,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:12:27,046 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 2399 treesize of output 2245 [2023-11-29 03:12:27,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:12:27,112 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 2231 treesize of output 1935 [2023-11-29 03:12:27,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1927 treesize of output 1843 [2023-11-29 03:12:27,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:12:27,216 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 1843 treesize of output 1769