./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-queue-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx --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 c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 20:56:54,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 20:56:54,230 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-21 20:56:54,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 20:56:54,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 20:56:54,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 20:56:54,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 20:56:54,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 20:56:54,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 20:56:54,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 20:56:54,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 20:56:54,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 20:56:54,288 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 20:56:54,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 20:56:54,291 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 20:56:54,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 20:56:54,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 20:56:54,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 20:56:54,293 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 20:56:54,293 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 20:56:54,294 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 20:56:54,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 20:56:54,295 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 20:56:54,295 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 20:56:54,296 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 20:56:54,296 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 20:56:54,297 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 20:56:54,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 20:56:54,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 20:56:54,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 20:56:54,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:56:54,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 20:56:54,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 20:56:54,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 20:56:54,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 20:56:54,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 20:56:54,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 20:56:54,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 20:56:54,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 20:56:54,303 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_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/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_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx 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 -> c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 [2023-11-21 20:56:54,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 20:56:54,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 20:56:54,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 20:56:54,683 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 20:56:54,684 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 20:56:54,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/forester-heap/dll-queue-1.i [2023-11-21 20:56:57,806 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 20:56:58,067 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 20:56:58,068 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/sv-benchmarks/c/forester-heap/dll-queue-1.i [2023-11-21 20:56:58,085 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/data/ae14b4a23/d49d26f2c5d44a3dbbf5650e65cd3119/FLAGf9aa91902 [2023-11-21 20:56:58,101 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/data/ae14b4a23/d49d26f2c5d44a3dbbf5650e65cd3119 [2023-11-21 20:56:58,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 20:56:58,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 20:56:58,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 20:56:58,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 20:56:58,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 20:56:58,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:56:58" (1/1) ... [2023-11-21 20:56:58,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@434928d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:58, skipping insertion in model container [2023-11-21 20:56:58,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:56:58" (1/1) ... [2023-11-21 20:56:58,169 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 20:56:58,554 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:56:58,572 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 20:56:58,624 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:56:58,659 INFO L206 MainTranslator]: Completed translation [2023-11-21 20:56:58,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:58 WrapperNode [2023-11-21 20:56:58,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 20:56:58,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 20:56:58,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 20:56:58,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 20:56:58,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:58" (1/1) ... [2023-11-21 20:56:58,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:58" (1/1) ... [2023-11-21 20:56:58,716 INFO L138 Inliner]: procedures = 119, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 227 [2023-11-21 20:56:58,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 20:56:58,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 20:56:58,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 20:56:58,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 20:56:58,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:58" (1/1) ... [2023-11-21 20:56:58,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:58" (1/1) ... [2023-11-21 20:56:58,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:58" (1/1) ... [2023-11-21 20:56:58,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:58" (1/1) ... [2023-11-21 20:56:58,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:58" (1/1) ... [2023-11-21 20:56:58,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:58" (1/1) ... [2023-11-21 20:56:58,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:58" (1/1) ... [2023-11-21 20:56:58,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:58" (1/1) ... [2023-11-21 20:56:58,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 20:56:58,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 20:56:58,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 20:56:58,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 20:56:58,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:58" (1/1) ... [2023-11-21 20:56:58,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:56:58,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:56:58,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 20:56:58,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 20:56:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-21 20:56:58,894 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-21 20:56:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 20:56:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 20:56:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 20:56:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 20:56:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-21 20:56:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 20:56:58,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 20:56:58,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 20:56:58,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 20:56:58,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 20:56:59,077 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 20:56:59,080 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 20:56:59,652 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 20:56:59,734 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 20:56:59,734 INFO L308 CfgBuilder]: Removed 31 assume(true) statements. [2023-11-21 20:56:59,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:56:59 BoogieIcfgContainer [2023-11-21 20:56:59,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 20:56:59,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 20:56:59,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 20:56:59,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 20:56:59,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 08:56:58" (1/3) ... [2023-11-21 20:56:59,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbccbce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:56:59, skipping insertion in model container [2023-11-21 20:56:59,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:58" (2/3) ... [2023-11-21 20:56:59,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbccbce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:56:59, skipping insertion in model container [2023-11-21 20:56:59,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:56:59" (3/3) ... [2023-11-21 20:56:59,748 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue-1.i [2023-11-21 20:56:59,802 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 20:56:59,803 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 63 error locations. [2023-11-21 20:56:59,919 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 20:56:59,929 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;@1d516ca7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 20:56:59,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2023-11-21 20:56:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 92 states have (on average 2.282608695652174) internal successors, (210), 155 states have internal predecessors, (210), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-21 20:56:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 20:56:59,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:56:59,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 20:56:59,950 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:56:59,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:56:59,960 INFO L85 PathProgramCache]: Analyzing trace with hash 15978, now seen corresponding path program 1 times [2023-11-21 20:56:59,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:56:59,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508229487] [2023-11-21 20:56:59,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:56:59,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:00,252 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-21 20:57:00,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:00,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508229487] [2023-11-21 20:57:00,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508229487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:00,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:00,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 20:57:00,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469069643] [2023-11-21 20:57:00,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:00,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:00,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:00,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:00,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:00,318 INFO L87 Difference]: Start difference. First operand has 171 states, 92 states have (on average 2.282608695652174) internal successors, (210), 155 states have internal predecessors, (210), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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-21 20:57:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:00,605 INFO L93 Difference]: Finished difference Result 149 states and 172 transitions. [2023-11-21 20:57:00,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:00,608 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-21 20:57:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:00,618 INFO L225 Difference]: With dead ends: 149 [2023-11-21 20:57:00,619 INFO L226 Difference]: Without dead ends: 148 [2023-11-21 20:57:00,621 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-21 20:57:00,625 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 139 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:00,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 97 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 20:57:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-21 20:57:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2023-11-21 20:57:00,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 79 states have (on average 1.9620253164556962) internal successors, (155), 143 states have internal predecessors, (155), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2023-11-21 20:57:00,678 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 2 [2023-11-21 20:57:00,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:00,679 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2023-11-21 20:57:00,679 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-21 20:57:00,680 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2023-11-21 20:57:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 20:57:00,680 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:00,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 20:57:00,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 20:57:00,681 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:00,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:00,682 INFO L85 PathProgramCache]: Analyzing trace with hash 15979, now seen corresponding path program 1 times [2023-11-21 20:57:00,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:00,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972994692] [2023-11-21 20:57:00,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:00,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:00,854 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-21 20:57:00,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:00,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972994692] [2023-11-21 20:57:00,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972994692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:00,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:00,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 20:57:00,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97864127] [2023-11-21 20:57:00,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:00,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:00,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:00,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:00,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:00,861 INFO L87 Difference]: Start difference. First operand 145 states and 169 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-21 20:57:01,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:01,058 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2023-11-21 20:57:01,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:01,059 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-21 20:57:01,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:01,068 INFO L225 Difference]: With dead ends: 136 [2023-11-21 20:57:01,068 INFO L226 Difference]: Without dead ends: 136 [2023-11-21 20:57:01,074 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-21 20:57:01,075 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 127 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:01,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 102 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 20:57:01,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-21 20:57:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2023-11-21 20:57:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 79 states have (on average 1.8101265822784811) internal successors, (143), 132 states have internal predecessors, (143), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 157 transitions. [2023-11-21 20:57:01,105 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 157 transitions. Word has length 2 [2023-11-21 20:57:01,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:01,105 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 157 transitions. [2023-11-21 20:57:01,106 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-21 20:57:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2023-11-21 20:57:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-21 20:57:01,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:01,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:01,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 20:57:01,107 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:01,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:01,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2125466043, now seen corresponding path program 1 times [2023-11-21 20:57:01,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:01,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666750654] [2023-11-21 20:57:01,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:01,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:01,336 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-21 20:57:01,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:01,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666750654] [2023-11-21 20:57:01,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666750654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:01,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:01,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:01,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88323350] [2023-11-21 20:57:01,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:01,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 20:57:01,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:01,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 20:57:01,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 20:57:01,340 INFO L87 Difference]: Start difference. First operand 134 states and 157 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:01,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:01,545 INFO L93 Difference]: Finished difference Result 140 states and 163 transitions. [2023-11-21 20:57:01,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:57:01,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-21 20:57:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:01,547 INFO L225 Difference]: With dead ends: 140 [2023-11-21 20:57:01,547 INFO L226 Difference]: Without dead ends: 140 [2023-11-21 20:57:01,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:57:01,549 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 222 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:01,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 102 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 20:57:01,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-21 20:57:01,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2023-11-21 20:57:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.7294117647058824) internal successors, (147), 132 states have internal predecessors, (147), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 161 transitions. [2023-11-21 20:57:01,561 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 161 transitions. Word has length 7 [2023-11-21 20:57:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:01,562 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 161 transitions. [2023-11-21 20:57:01,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 161 transitions. [2023-11-21 20:57:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-21 20:57:01,563 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:01,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:01,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 20:57:01,563 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:01,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:01,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2125466042, now seen corresponding path program 1 times [2023-11-21 20:57:01,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:01,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147356063] [2023-11-21 20:57:01,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:01,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:01,771 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-21 20:57:01,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:01,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147356063] [2023-11-21 20:57:01,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147356063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:01,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:01,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 20:57:01,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496857304] [2023-11-21 20:57:01,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:01,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:57:01,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:01,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:57:01,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:57:01,775 INFO L87 Difference]: Start difference. First operand 134 states and 161 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:02,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:02,125 INFO L93 Difference]: Finished difference Result 213 states and 252 transitions. [2023-11-21 20:57:02,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:57:02,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-21 20:57:02,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:02,127 INFO L225 Difference]: With dead ends: 213 [2023-11-21 20:57:02,127 INFO L226 Difference]: Without dead ends: 213 [2023-11-21 20:57:02,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-21 20:57:02,129 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 352 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:02,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 133 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 20:57:02,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-11-21 20:57:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 140. [2023-11-21 20:57:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 91 states have (on average 1.7032967032967032) internal successors, (155), 138 states have internal predecessors, (155), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2023-11-21 20:57:02,141 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 7 [2023-11-21 20:57:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:02,142 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2023-11-21 20:57:02,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2023-11-21 20:57:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-21 20:57:02,143 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:02,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:02,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 20:57:02,144 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:02,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:02,145 INFO L85 PathProgramCache]: Analyzing trace with hash 945106439, now seen corresponding path program 1 times [2023-11-21 20:57:02,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:02,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312355077] [2023-11-21 20:57:02,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:02,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:02,181 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-21 20:57:02,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:02,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312355077] [2023-11-21 20:57:02,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312355077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:02,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:02,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:02,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746675088] [2023-11-21 20:57:02,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:02,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:02,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:02,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:02,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:02,184 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-21 20:57:02,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:02,239 INFO L93 Difference]: Finished difference Result 135 states and 158 transitions. [2023-11-21 20:57:02,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:02,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2023-11-21 20:57:02,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:02,241 INFO L225 Difference]: With dead ends: 135 [2023-11-21 20:57:02,241 INFO L226 Difference]: Without dead ends: 135 [2023-11-21 20:57:02,241 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-21 20:57:02,243 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 110 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:02,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 127 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 20:57:02,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-21 20:57:02,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-11-21 20:57:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 91 states have (on average 1.6373626373626373) internal successors, (149), 133 states have internal predecessors, (149), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2023-11-21 20:57:02,251 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 10 [2023-11-21 20:57:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:02,252 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2023-11-21 20:57:02,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-21 20:57:02,252 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2023-11-21 20:57:02,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-21 20:57:02,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:02,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:02,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 20:57:02,254 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:02,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:02,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1831998218, now seen corresponding path program 1 times [2023-11-21 20:57:02,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:02,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610517862] [2023-11-21 20:57:02,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:02,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:02,368 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-21 20:57:02,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:02,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610517862] [2023-11-21 20:57:02,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610517862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:02,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:02,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 20:57:02,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092560603] [2023-11-21 20:57:02,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:02,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 20:57:02,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:02,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 20:57:02,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:57:02,371 INFO L87 Difference]: Start difference. First operand 135 states and 158 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:02,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:02,537 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2023-11-21 20:57:02,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:57:02,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-21 20:57:02,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:02,539 INFO L225 Difference]: With dead ends: 134 [2023-11-21 20:57:02,539 INFO L226 Difference]: Without dead ends: 134 [2023-11-21 20:57:02,540 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-21 20:57:02,541 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 6 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:02,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 365 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 20:57:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-21 20:57:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-11-21 20:57:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.6153846153846154) internal successors, (147), 132 states have internal predecessors, (147), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2023-11-21 20:57:02,549 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 9 [2023-11-21 20:57:02,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:02,549 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2023-11-21 20:57:02,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2023-11-21 20:57:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-21 20:57:02,550 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:02,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:02,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 20:57:02,551 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:02,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:02,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1831998219, now seen corresponding path program 1 times [2023-11-21 20:57:02,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:02,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54363931] [2023-11-21 20:57:02,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:02,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:02,725 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-21 20:57:02,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:02,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54363931] [2023-11-21 20:57:02,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54363931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:02,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:02,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 20:57:02,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927505826] [2023-11-21 20:57:02,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:02,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 20:57:02,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:02,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 20:57:02,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:57:02,729 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:02,905 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2023-11-21 20:57:02,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:57:02,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-21 20:57:02,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:02,908 INFO L225 Difference]: With dead ends: 133 [2023-11-21 20:57:02,908 INFO L226 Difference]: Without dead ends: 133 [2023-11-21 20:57:02,908 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-21 20:57:02,909 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:02,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 365 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 20:57:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-21 20:57:02,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-11-21 20:57:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 91 states have (on average 1.5934065934065933) internal successors, (145), 131 states have internal predecessors, (145), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2023-11-21 20:57:02,915 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 9 [2023-11-21 20:57:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:02,915 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2023-11-21 20:57:02,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2023-11-21 20:57:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-21 20:57:02,916 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:02,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:02,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 20:57:02,917 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:02,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:02,918 INFO L85 PathProgramCache]: Analyzing trace with hash -385860111, now seen corresponding path program 1 times [2023-11-21 20:57:02,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:02,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595807230] [2023-11-21 20:57:02,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:03,269 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-21 20:57:03,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:03,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595807230] [2023-11-21 20:57:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595807230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:03,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:03,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 20:57:03,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278400950] [2023-11-21 20:57:03,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:03,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-21 20:57:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:03,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-21 20:57:03,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-21 20:57:03,272 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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-21 20:57:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:03,675 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2023-11-21 20:57:03,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 20:57:03,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-11-21 20:57:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:03,678 INFO L225 Difference]: With dead ends: 135 [2023-11-21 20:57:03,678 INFO L226 Difference]: Without dead ends: 135 [2023-11-21 20:57:03,679 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-21 20:57:03,679 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 210 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:03,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 346 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 20:57:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-21 20:57:03,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2023-11-21 20:57:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 91 states have (on average 1.5824175824175823) internal successors, (144), 130 states have internal predecessors, (144), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2023-11-21 20:57:03,685 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 11 [2023-11-21 20:57:03,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:03,685 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2023-11-21 20:57:03,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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-21 20:57:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2023-11-21 20:57:03,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-21 20:57:03,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:03,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:03,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 20:57:03,687 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:03,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash -385860110, now seen corresponding path program 1 times [2023-11-21 20:57:03,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:03,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351808184] [2023-11-21 20:57:03,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:03,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:03,998 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-21 20:57:03,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:03,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351808184] [2023-11-21 20:57:03,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351808184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:03,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:03,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 20:57:03,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213458003] [2023-11-21 20:57:03,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:04,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 20:57:04,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:04,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 20:57:04,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-21 20:57:04,001 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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-21 20:57:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:04,710 INFO L93 Difference]: Finished difference Result 189 states and 218 transitions. [2023-11-21 20:57:04,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-21 20:57:04,714 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-11-21 20:57:04,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:04,716 INFO L225 Difference]: With dead ends: 189 [2023-11-21 20:57:04,716 INFO L226 Difference]: Without dead ends: 189 [2023-11-21 20:57:04,716 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-21 20:57:04,717 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 275 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:04,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 587 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-21 20:57:04,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-11-21 20:57:04,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 119. [2023-11-21 20:57:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.5294117647058822) internal successors, (130), 117 states have internal predecessors, (130), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:04,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 139 transitions. [2023-11-21 20:57:04,723 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 139 transitions. Word has length 11 [2023-11-21 20:57:04,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:04,723 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 139 transitions. [2023-11-21 20:57:04,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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-21 20:57:04,723 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2023-11-21 20:57:04,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-21 20:57:04,724 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:04,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:04,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 20:57:04,725 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:04,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:04,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1590650999, now seen corresponding path program 1 times [2023-11-21 20:57:04,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:04,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561498478] [2023-11-21 20:57:04,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:04,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:04,765 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-21 20:57:04,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:04,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561498478] [2023-11-21 20:57:04,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561498478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:04,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:04,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:57:04,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30513859] [2023-11-21 20:57:04,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:04,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:04,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:04,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:04,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:04,767 INFO L87 Difference]: Start difference. First operand 119 states and 139 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-21 20:57:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:04,824 INFO L93 Difference]: Finished difference Result 166 states and 193 transitions. [2023-11-21 20:57:04,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:04,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 16 [2023-11-21 20:57:04,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:04,826 INFO L225 Difference]: With dead ends: 166 [2023-11-21 20:57:04,826 INFO L226 Difference]: Without dead ends: 166 [2023-11-21 20:57:04,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:04,828 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 38 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:04,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 210 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 20:57:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-11-21 20:57:04,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 132. [2023-11-21 20:57:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 1.469387755102041) internal successors, (144), 130 states have internal predecessors, (144), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2023-11-21 20:57:04,838 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 16 [2023-11-21 20:57:04,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:04,839 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2023-11-21 20:57:04,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-21 20:57:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2023-11-21 20:57:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-21 20:57:04,842 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:04,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:04,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 20:57:04,843 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:04,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1407875847, now seen corresponding path program 1 times [2023-11-21 20:57:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:04,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053845778] [2023-11-21 20:57:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:04,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:05,169 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-21 20:57:05,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:05,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053845778] [2023-11-21 20:57:05,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053845778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:05,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:05,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:57:05,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074454330] [2023-11-21 20:57:05,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:05,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 20:57:05,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:05,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 20:57:05,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:57:05,174 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:05,324 INFO L93 Difference]: Finished difference Result 137 states and 158 transitions. [2023-11-21 20:57:05,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:57:05,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-21 20:57:05,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:05,326 INFO L225 Difference]: With dead ends: 137 [2023-11-21 20:57:05,326 INFO L226 Difference]: Without dead ends: 137 [2023-11-21 20:57:05,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-21 20:57:05,327 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 7 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:05,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 405 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 20:57:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-21 20:57:05,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-11-21 20:57:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 101 states have (on average 1.4554455445544554) internal successors, (147), 133 states have internal predecessors, (147), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:05,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2023-11-21 20:57:05,339 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 17 [2023-11-21 20:57:05,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:05,339 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2023-11-21 20:57:05,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:05,340 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2023-11-21 20:57:05,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 20:57:05,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:05,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:05,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 20:57:05,342 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:05,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:05,343 INFO L85 PathProgramCache]: Analyzing trace with hash -695052292, now seen corresponding path program 1 times [2023-11-21 20:57:05,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:05,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475657195] [2023-11-21 20:57:05,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:05,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:05,459 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-21 20:57:05,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:05,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475657195] [2023-11-21 20:57:05,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475657195] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:05,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:05,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:57:05,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316713284] [2023-11-21 20:57:05,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:05,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 20:57:05,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:05,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 20:57:05,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:57:05,463 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:05,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:05,615 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2023-11-21 20:57:05,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:57:05,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-21 20:57:05,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:05,617 INFO L225 Difference]: With dead ends: 135 [2023-11-21 20:57:05,618 INFO L226 Difference]: Without dead ends: 135 [2023-11-21 20:57:05,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:57:05,619 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 112 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:05,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 246 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 20:57:05,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-21 20:57:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-11-21 20:57:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 133 states have internal predecessors, (146), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2023-11-21 20:57:05,626 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 18 [2023-11-21 20:57:05,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:05,627 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2023-11-21 20:57:05,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:05,627 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2023-11-21 20:57:05,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-21 20:57:05,628 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:05,628 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-21 20:57:05,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 20:57:05,629 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:05,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:05,630 INFO L85 PathProgramCache]: Analyzing trace with hash 275840090, now seen corresponding path program 1 times [2023-11-21 20:57:05,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:05,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323854836] [2023-11-21 20:57:05,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:05,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:05,755 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-21 20:57:05,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:05,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323854836] [2023-11-21 20:57:05,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323854836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:05,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:05,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:57:05,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678219908] [2023-11-21 20:57:05,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:05,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:57:05,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:05,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:57:05,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:57:05,758 INFO L87 Difference]: Start difference. First operand 135 states and 155 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-21 20:57:05,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:05,915 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2023-11-21 20:57:05,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:57:05,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 19 [2023-11-21 20:57:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:05,917 INFO L225 Difference]: With dead ends: 136 [2023-11-21 20:57:05,917 INFO L226 Difference]: Without dead ends: 136 [2023-11-21 20:57:05,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-21 20:57:05,918 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 292 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:05,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 179 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 20:57:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-21 20:57:05,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2023-11-21 20:57:05,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 132 states have internal predecessors, (145), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:05,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2023-11-21 20:57:05,923 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 19 [2023-11-21 20:57:05,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:05,923 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2023-11-21 20:57:05,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-21 20:57:05,924 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2023-11-21 20:57:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-21 20:57:05,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:05,924 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-21 20:57:05,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 20:57:05,925 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:05,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:05,926 INFO L85 PathProgramCache]: Analyzing trace with hash -265030582, now seen corresponding path program 1 times [2023-11-21 20:57:05,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:05,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360416627] [2023-11-21 20:57:05,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:05,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:06,026 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-21 20:57:06,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:06,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360416627] [2023-11-21 20:57:06,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360416627] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:06,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428216473] [2023-11-21 20:57:06,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:06,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:06,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:06,034 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:06,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 20:57:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:06,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-21 20:57:06,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:06,276 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 13 treesize of output 9 [2023-11-21 20:57:06,324 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-21 20:57:06,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:06,385 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-21 20:57:06,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428216473] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:06,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:06,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-11-21 20:57:06,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581719540] [2023-11-21 20:57:06,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:06,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:57:06,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:06,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:57:06,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:57:06,388 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-21 20:57:06,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:06,579 INFO L93 Difference]: Finished difference Result 150 states and 169 transitions. [2023-11-21 20:57:06,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 20:57:06,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-21 20:57:06,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:06,581 INFO L225 Difference]: With dead ends: 150 [2023-11-21 20:57:06,581 INFO L226 Difference]: Without dead ends: 149 [2023-11-21 20:57:06,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-21 20:57:06,582 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 27 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:06,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 331 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 20:57:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-21 20:57:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 140. [2023-11-21 20:57:06,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 107 states have (on average 1.411214953271028) internal successors, (151), 138 states have internal predecessors, (151), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2023-11-21 20:57:06,587 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 21 [2023-11-21 20:57:06,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:06,588 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2023-11-21 20:57:06,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-21 20:57:06,589 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2023-11-21 20:57:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-21 20:57:06,589 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:06,590 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-21 20:57:06,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:06,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-21 20:57:06,802 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:06,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:06,802 INFO L85 PathProgramCache]: Analyzing trace with hash -265032549, now seen corresponding path program 1 times [2023-11-21 20:57:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:06,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604416874] [2023-11-21 20:57:06,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:06,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:07,082 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-21 20:57:07,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:07,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604416874] [2023-11-21 20:57:07,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604416874] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:07,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558241791] [2023-11-21 20:57:07,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:07,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:07,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:07,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:07,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 20:57:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:07,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-21 20:57:07,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:07,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 20:57:07,212 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-21 20:57:07,235 INFO L378 Elim1Store]: Elim1 eliminated variable 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 21 treesize of output 20 [2023-11-21 20:57:07,244 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-21 20:57:07,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:07,286 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-21 20:57:07,296 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 36 treesize of output 23 [2023-11-21 20:57:07,461 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-21 20:57:07,461 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:07,562 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-21 20:57:07,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558241791] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:07,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:07,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 5 [2023-11-21 20:57:07,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936950490] [2023-11-21 20:57:07,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:07,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 20:57:07,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:07,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 20:57:07,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:57:07,565 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:07,679 INFO L93 Difference]: Finished difference Result 140 states and 158 transitions. [2023-11-21 20:57:07,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:57:07,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-21 20:57:07,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:07,681 INFO L225 Difference]: With dead ends: 140 [2023-11-21 20:57:07,681 INFO L226 Difference]: Without dead ends: 126 [2023-11-21 20:57:07,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:57:07,682 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 3 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:07,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 290 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 20:57:07,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-21 20:57:07,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-11-21 20:57:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 124 states have internal predecessors, (136), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2023-11-21 20:57:07,687 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 21 [2023-11-21 20:57:07,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:07,687 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2023-11-21 20:57:07,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:07,688 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2023-11-21 20:57:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-21 20:57:07,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:07,689 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-21 20:57:07,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:07,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:07,917 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:07,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:07,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1408130527, now seen corresponding path program 1 times [2023-11-21 20:57:07,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:07,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644668562] [2023-11-21 20:57:07,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:07,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:08,424 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-21 20:57:08,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:08,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644668562] [2023-11-21 20:57:08,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644668562] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:08,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132850254] [2023-11-21 20:57:08,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:08,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:08,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:08,427 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:08,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 20:57:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:08,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-21 20:57:08,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:08,580 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-21 20:57:08,621 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 20:57:08,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-21 20:57:08,670 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-21 20:57:08,679 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-21 20:57:08,772 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 20:57:08,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 20:57:08,782 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-21 20:57:08,806 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-21 20:57:08,849 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 20:57:08,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-11-21 20:57:08,891 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-21 20:57:08,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 24 treesize of output 12 [2023-11-21 20:57:08,984 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-21 20:57:08,985 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:09,311 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_488))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (= .cse0 0) (not (= (select (select (store .cse1 .cse0 v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)))))) (forall ((v_ArrVal_487 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_487) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (not (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_488))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_490)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (forall ((v_ArrVal_487 (Array Int Int))) (<= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_487) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) is different from false [2023-11-21 20:57:09,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:09,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2023-11-21 20:57:09,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:09,470 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 141 treesize of output 128 [2023-11-21 20:57:09,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:09,489 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 76 treesize of output 75 [2023-11-21 20:57:09,497 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 66 treesize of output 62 [2023-11-21 20:57:09,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:09,585 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 18 treesize of output 19 [2023-11-21 20:57:09,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-11-21 20:57:09,605 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-21 20:57:09,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:09,615 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 56 treesize of output 40 [2023-11-21 20:57:09,620 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:57:09,638 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-21 20:57:09,639 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 162 treesize of output 129 [2023-11-21 20:57:09,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 6 treesize of output 4 [2023-11-21 20:57:09,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:09,673 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 18 treesize of output 19 [2023-11-21 20:57:09,676 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:57:09,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-21 20:57:09,886 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-21 20:57:09,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132850254] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:09,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:09,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 25 [2023-11-21 20:57:09,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142178099] [2023-11-21 20:57:09,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:09,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-21 20:57:09,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:09,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-21 20:57:09,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=465, Unknown=13, NotChecked=44, Total=600 [2023-11-21 20:57:09,890 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 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-21 20:57:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:12,541 INFO L93 Difference]: Finished difference Result 299 states and 350 transitions. [2023-11-21 20:57:12,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 20:57:12,542 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 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 29 [2023-11-21 20:57:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:12,544 INFO L225 Difference]: With dead ends: 299 [2023-11-21 20:57:12,544 INFO L226 Difference]: Without dead ends: 299 [2023-11-21 20:57:12,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=202, Invalid=968, Unknown=24, NotChecked=66, Total=1260 [2023-11-21 20:57:12,545 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 569 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 31 mSolverCounterUnsat, 154 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 154 IncrementalHoareTripleChecker+Unknown, 320 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:12,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1347 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1516 Invalid, 154 Unknown, 320 Unchecked, 2.1s Time] [2023-11-21 20:57:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-21 20:57:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 140. [2023-11-21 20:57:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 107 states have (on average 1.4205607476635513) internal successors, (152), 138 states have internal predecessors, (152), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 160 transitions. [2023-11-21 20:57:12,552 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 160 transitions. Word has length 29 [2023-11-21 20:57:12,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:12,552 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 160 transitions. [2023-11-21 20:57:12,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 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-21 20:57:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 160 transitions. [2023-11-21 20:57:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-21 20:57:12,553 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:12,554 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] [2023-11-21 20:57:12,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-21 20:57:12,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:12,776 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:12,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:12,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1521654695, now seen corresponding path program 1 times [2023-11-21 20:57:12,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:12,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153904586] [2023-11-21 20:57:12,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:12,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:12,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:12,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153904586] [2023-11-21 20:57:12,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153904586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:12,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:12,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:57:12,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373368851] [2023-11-21 20:57:12,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:12,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:12,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:12,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:12,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:12,829 INFO L87 Difference]: Start difference. First operand 140 states and 160 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:12,891 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2023-11-21 20:57:12,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:12,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-21 20:57:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:12,895 INFO L225 Difference]: With dead ends: 192 [2023-11-21 20:57:12,895 INFO L226 Difference]: Without dead ends: 192 [2023-11-21 20:57:12,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:12,896 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 45 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:12,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 203 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 20:57:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-11-21 20:57:12,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 158. [2023-11-21 20:57:12,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 125 states have (on average 1.36) internal successors, (170), 156 states have internal predecessors, (170), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:12,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2023-11-21 20:57:12,905 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 30 [2023-11-21 20:57:12,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:12,905 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2023-11-21 20:57:12,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:12,905 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2023-11-21 20:57:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-21 20:57:12,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:12,908 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] [2023-11-21 20:57:12,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 20:57:12,908 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:12,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash -300780540, now seen corresponding path program 1 times [2023-11-21 20:57:12,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:12,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229491786] [2023-11-21 20:57:12,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:12,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:13,453 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-21 20:57:13,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:13,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229491786] [2023-11-21 20:57:13,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229491786] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:13,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061622031] [2023-11-21 20:57:13,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:13,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:13,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:13,458 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:13,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 20:57:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:13,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-21 20:57:13,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:13,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 20:57:13,658 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 20:57:13,658 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-21 20:57:13,711 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-21 20:57:13,816 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 20:57:13,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 20:57:13,872 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 20:57:13,873 INFO L378 Elim1Store]: Elim1 eliminated variable 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-21 20:57:13,910 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 20:57:13,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-21 20:57:14,060 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-21 20:57:14,130 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-21 20:57:14,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:14,186 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_634 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_634) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-11-21 20:57:14,201 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_634 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_634) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-11-21 20:57:14,208 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_632))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_634)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-11-21 20:57:14,215 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_632))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_634)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-11-21 20:57:14,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:14,228 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 31 [2023-11-21 20:57:14,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:14,239 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 252 treesize of output 227 [2023-11-21 20:57:14,255 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 171 treesize of output 163 [2023-11-21 20:57:14,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:14,269 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 163 treesize of output 159 [2023-11-21 20:57:15,670 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-21 20:57:15,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061622031] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:15,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:15,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 25 [2023-11-21 20:57:15,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233820350] [2023-11-21 20:57:15,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:15,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-21 20:57:15,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:15,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-21 20:57:15,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=353, Unknown=4, NotChecked=172, Total=650 [2023-11-21 20:57:15,674 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand has 26 states, 25 states have (on average 4.04) internal successors, (101), 26 states have internal predecessors, (101), 0 states have call successors, (0), 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-21 20:57:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:16,711 INFO L93 Difference]: Finished difference Result 277 states and 316 transitions. [2023-11-21 20:57:16,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-21 20:57:16,713 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.04) internal successors, (101), 26 states have internal predecessors, (101), 0 states have call successors, (0), 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 35 [2023-11-21 20:57:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:16,714 INFO L225 Difference]: With dead ends: 277 [2023-11-21 20:57:16,714 INFO L226 Difference]: Without dead ends: 277 [2023-11-21 20:57:16,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=245, Invalid=697, Unknown=4, NotChecked=244, Total=1190 [2023-11-21 20:57:16,716 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 1138 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1144 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:16,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 560 Invalid, 1845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 640 Invalid, 0 Unknown, 1144 Unchecked, 0.8s Time] [2023-11-21 20:57:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2023-11-21 20:57:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 167. [2023-11-21 20:57:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 134 states have (on average 1.3582089552238805) internal successors, (182), 165 states have internal predecessors, (182), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 190 transitions. [2023-11-21 20:57:16,724 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 190 transitions. Word has length 35 [2023-11-21 20:57:16,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:16,724 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 190 transitions. [2023-11-21 20:57:16,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.04) internal successors, (101), 26 states have internal predecessors, (101), 0 states have call successors, (0), 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-21 20:57:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2023-11-21 20:57:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-21 20:57:16,725 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:16,726 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] [2023-11-21 20:57:16,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:16,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-21 20:57:16,942 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:16,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:16,943 INFO L85 PathProgramCache]: Analyzing trace with hash -300780539, now seen corresponding path program 1 times [2023-11-21 20:57:16,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:16,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974305739] [2023-11-21 20:57:16,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:16,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:17,604 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-21 20:57:17,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:17,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974305739] [2023-11-21 20:57:17,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974305739] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:17,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134845594] [2023-11-21 20:57:17,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:17,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:17,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:17,611 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:17,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 20:57:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:17,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-21 20:57:17,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:17,769 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-21 20:57:17,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-21 20:57:17,812 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 20:57:17,813 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-21 20:57:17,826 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-21 20:57:17,833 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-21 20:57:17,930 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 20:57:17,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-21 20:57:17,937 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-21 20:57:17,995 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 20:57:17,995 INFO L378 Elim1Store]: Elim1 eliminated variable 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-21 20:57:18,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:57:18,008 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-21 20:57:18,035 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 20:57:18,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 20:57:18,043 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-21 20:57:18,209 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-21 20:57:18,213 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-21 20:57:18,230 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-21 20:57:18,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:18,380 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_736 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8)))) is different from false [2023-11-21 20:57:18,404 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_736 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_736) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_736) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_735) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-11-21 20:57:18,420 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_731 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_731) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_732) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_736) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_731 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_732))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_731) .cse0 v_ArrVal_736) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_735) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2023-11-21 20:57:18,438 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_731 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_731) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_732) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_736) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_731 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_732))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_731) .cse1 v_ArrVal_736) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_735) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2023-11-21 20:57:18,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:18,450 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-21 20:57:18,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:18,458 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 30 treesize of output 31 [2023-11-21 20:57:18,462 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 54 treesize of output 46 [2023-11-21 20:57:18,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:18,473 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 112 treesize of output 111 [2023-11-21 20:57:18,483 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 60 [2023-11-21 20:57:18,490 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 60 treesize of output 58 [2023-11-21 20:57:18,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 80 [2023-11-21 20:57:18,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:18,564 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 73 treesize of output 74 [2023-11-21 20:57:18,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:18,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2023-11-21 20:57:18,579 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:57:18,580 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:57:18,583 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 74 treesize of output 50 [2023-11-21 20:57:18,595 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:57:18,598 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 42 treesize of output 30 [2023-11-21 20:57:18,722 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-21 20:57:18,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134845594] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:18,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:18,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 24 [2023-11-21 20:57:18,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605093811] [2023-11-21 20:57:18,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:18,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-21 20:57:18,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:18,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-21 20:57:18,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=353, Unknown=4, NotChecked=164, Total=600 [2023-11-21 20:57:18,726 INFO L87 Difference]: Start difference. First operand 167 states and 190 transitions. Second operand has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 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-21 20:57:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:19,991 INFO L93 Difference]: Finished difference Result 268 states and 305 transitions. [2023-11-21 20:57:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-21 20:57:19,991 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 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 35 [2023-11-21 20:57:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:19,993 INFO L225 Difference]: With dead ends: 268 [2023-11-21 20:57:19,993 INFO L226 Difference]: Without dead ends: 268 [2023-11-21 20:57:19,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=259, Invalid=1013, Unknown=4, NotChecked=284, Total=1560 [2023-11-21 20:57:19,995 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 743 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1076 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:19,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 604 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 792 Invalid, 0 Unknown, 1076 Unchecked, 0.7s Time] [2023-11-21 20:57:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-11-21 20:57:20,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 170. [2023-11-21 20:57:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.3503649635036497) internal successors, (185), 168 states have internal predecessors, (185), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 193 transitions. [2023-11-21 20:57:20,002 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 193 transitions. Word has length 35 [2023-11-21 20:57:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:20,003 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 193 transitions. [2023-11-21 20:57:20,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 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-21 20:57:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 193 transitions. [2023-11-21 20:57:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-21 20:57:20,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:20,004 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] [2023-11-21 20:57:20,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-21 20:57:20,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:20,218 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:20,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:20,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1252501298, now seen corresponding path program 1 times [2023-11-21 20:57:20,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:20,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193190914] [2023-11-21 20:57:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:20,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:20,267 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-21 20:57:20,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193190914] [2023-11-21 20:57:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193190914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:20,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:20,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:57:20,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298922904] [2023-11-21 20:57:20,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:20,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:20,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:20,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:20,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:20,272 INFO L87 Difference]: Start difference. First operand 170 states and 193 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-21 20:57:20,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:20,307 INFO L93 Difference]: Finished difference Result 171 states and 193 transitions. [2023-11-21 20:57:20,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:20,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 38 [2023-11-21 20:57:20,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:20,309 INFO L225 Difference]: With dead ends: 171 [2023-11-21 20:57:20,309 INFO L226 Difference]: Without dead ends: 171 [2023-11-21 20:57:20,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:20,311 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:20,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 20:57:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-21 20:57:20,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2023-11-21 20:57:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 138 states have (on average 1.3405797101449275) internal successors, (185), 169 states have internal predecessors, (185), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 193 transitions. [2023-11-21 20:57:20,321 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 193 transitions. Word has length 38 [2023-11-21 20:57:20,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:20,322 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 193 transitions. [2023-11-21 20:57:20,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-21 20:57:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 193 transitions. [2023-11-21 20:57:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-21 20:57:20,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:20,324 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] [2023-11-21 20:57:20,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-21 20:57:20,324 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:20,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:20,325 INFO L85 PathProgramCache]: Analyzing trace with hash -43388861, now seen corresponding path program 1 times [2023-11-21 20:57:20,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:20,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323035480] [2023-11-21 20:57:20,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:20,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:21,343 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-21 20:57:21,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:21,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323035480] [2023-11-21 20:57:21,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323035480] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:21,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752292848] [2023-11-21 20:57:21,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:21,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:21,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:21,346 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:21,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 20:57:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:21,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-21 20:57:21,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:21,506 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-21 20:57:21,563 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 20:57:21,564 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-21 20:57:21,593 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-21 20:57:21,604 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-21 20:57:21,677 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 20:57:21,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 20:57:21,686 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-21 20:57:21,743 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 20:57:21,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-21 20:57:21,747 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-21 20:57:21,762 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 20:57:21,762 INFO L378 Elim1Store]: Elim1 eliminated variable 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-21 20:57:21,826 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 20:57:21,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2023-11-21 20:57:21,831 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-21 20:57:21,838 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-21 20:57:21,995 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-21 20:57:22,002 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-21 20:57:22,022 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-21 20:57:22,022 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:22,127 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 69 treesize of output 49 [2023-11-21 20:57:22,135 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_884 (Array Int Int))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_884) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_883 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))) is different from false [2023-11-21 20:57:22,305 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_879 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_879))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((v_ArrVal_884 (Array Int Int))) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_878) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_884) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1))))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_879 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_879))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (< .cse1 0) (forall ((v_ArrVal_884 (Array Int Int))) (< .cse1 (+ (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_878) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_884) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1))))))) (or (forall ((v_ArrVal_879 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_879) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_883 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_878))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= (select (select (store .cse3 .cse4 v_ArrVal_883) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse4)))))) is different from false [2023-11-21 20:57:22,341 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_879 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_879))) (or (forall ((v_ArrVal_884 (Array Int Int))) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_878) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_884) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1)) (< (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (or (forall ((v_ArrVal_879 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_879) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_883 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_878))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= (select (select (store .cse2 .cse3 v_ArrVal_883) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse3))))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_879 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_879))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (forall ((v_ArrVal_884 (Array Int Int))) (< .cse4 (+ (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_878) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_884) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1))) (< .cse4 0))))))) is different from false [2023-11-21 20:57:22,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:22,381 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 72 treesize of output 56 [2023-11-21 20:57:22,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:22,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2023-11-21 20:57:22,395 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 68 treesize of output 60 [2023-11-21 20:57:22,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:22,409 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 251 treesize of output 214 [2023-11-21 20:57:22,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:22,436 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 80 treesize of output 76 [2023-11-21 20:57:22,444 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 76 [2023-11-21 20:57:22,452 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 54 treesize of output 46 [2023-11-21 20:57:22,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:22,548 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 18 treesize of output 19 [2023-11-21 20:57:22,551 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:57:22,554 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-21 20:57:22,563 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 20:57:22,564 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 1 [2023-11-21 20:57:22,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:22,572 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 55 treesize of output 47 [2023-11-21 20:57:22,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:22,581 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 28 treesize of output 29 [2023-11-21 20:57:22,585 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:57:22,588 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 26 treesize of output 18 [2023-11-21 20:57:22,592 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:57:22,602 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2023-11-21 20:57:22,602 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 37 treesize of output 29 [2023-11-21 20:57:22,614 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 20:57:22,751 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-21 20:57:22,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752292848] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:22,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:22,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 12] total 33 [2023-11-21 20:57:22,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332814348] [2023-11-21 20:57:22,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:22,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-21 20:57:22,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:22,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-21 20:57:22,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=829, Unknown=3, NotChecked=180, Total=1122 [2023-11-21 20:57:22,754 INFO L87 Difference]: Start difference. First operand 171 states and 193 transitions. Second operand has 34 states, 34 states have (on average 3.1470588235294117) internal successors, (107), 33 states have internal predecessors, (107), 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-21 20:57:24,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:24,226 INFO L93 Difference]: Finished difference Result 273 states and 310 transitions. [2023-11-21 20:57:24,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-21 20:57:24,227 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.1470588235294117) internal successors, (107), 33 states have internal predecessors, (107), 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 39 [2023-11-21 20:57:24,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:24,228 INFO L225 Difference]: With dead ends: 273 [2023-11-21 20:57:24,229 INFO L226 Difference]: Without dead ends: 273 [2023-11-21 20:57:24,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=310, Invalid=1679, Unknown=3, NotChecked=264, Total=2256 [2023-11-21 20:57:24,231 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 1084 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 782 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:24,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 819 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 864 Invalid, 0 Unknown, 782 Unchecked, 0.8s Time] [2023-11-21 20:57:24,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-11-21 20:57:24,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 170. [2023-11-21 20:57:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 168 states have internal predecessors, (183), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2023-11-21 20:57:24,239 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 191 transitions. Word has length 39 [2023-11-21 20:57:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:24,239 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 191 transitions. [2023-11-21 20:57:24,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.1470588235294117) internal successors, (107), 33 states have internal predecessors, (107), 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-21 20:57:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 191 transitions. [2023-11-21 20:57:24,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-21 20:57:24,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:24,241 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] [2023-11-21 20:57:24,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:24,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:24,458 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:24,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:24,459 INFO L85 PathProgramCache]: Analyzing trace with hash -54762027, now seen corresponding path program 1 times [2023-11-21 20:57:24,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:24,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24577881] [2023-11-21 20:57:24,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:24,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 20:57:24,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:24,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24577881] [2023-11-21 20:57:24,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24577881] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:24,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866247409] [2023-11-21 20:57:24,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:24,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:24,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:24,623 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:24,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 20:57:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:24,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-21 20:57:24,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:24,866 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 17 [2023-11-21 20:57:24,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-21 20:57:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 20:57:24,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 20:57:24,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866247409] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:24,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:24,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-11-21 20:57:24,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307875955] [2023-11-21 20:57:24,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:24,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:57:24,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:24,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:57:24,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:57:24,963 INFO L87 Difference]: Start difference. First operand 170 states and 191 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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-21 20:57:25,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:25,113 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2023-11-21 20:57:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:57:25,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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 39 [2023-11-21 20:57:25,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:25,117 INFO L225 Difference]: With dead ends: 193 [2023-11-21 20:57:25,117 INFO L226 Difference]: Without dead ends: 193 [2023-11-21 20:57:25,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-21 20:57:25,118 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 138 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:25,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 291 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 20:57:25,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-21 20:57:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2023-11-21 20:57:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 155 states have (on average 1.3483870967741935) internal successors, (209), 186 states have internal predecessors, (209), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 217 transitions. [2023-11-21 20:57:25,126 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 217 transitions. Word has length 39 [2023-11-21 20:57:25,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:25,127 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 217 transitions. [2023-11-21 20:57:25,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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-21 20:57:25,127 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 217 transitions. [2023-11-21 20:57:25,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-21 20:57:25,128 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:25,128 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] [2023-11-21 20:57:25,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:25,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:25,342 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:25,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:25,342 INFO L85 PathProgramCache]: Analyzing trace with hash -54763994, now seen corresponding path program 1 times [2023-11-21 20:57:25,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:25,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982080273] [2023-11-21 20:57:25,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:25,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:25,789 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-21 20:57:25,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:25,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982080273] [2023-11-21 20:57:25,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982080273] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:25,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552571946] [2023-11-21 20:57:25,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:25,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:25,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:25,792 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:25,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-21 20:57:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:25,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-21 20:57:25,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:26,004 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-21 20:57:26,045 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 20:57:26,045 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-21 20:57:26,081 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-21 20:57:26,171 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 20:57:26,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 20:57:26,230 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 20:57:26,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-21 20:57:26,262 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 20:57:26,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 20:57:26,445 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-21 20:57:26,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2023-11-21 20:57:26,490 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-21 20:57:26,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:26,615 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1078 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1078) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_1078 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1078) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-11-21 20:57:26,683 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1076 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1076))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1078)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1076 (Array Int Int))) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1076))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1078)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-11-21 20:57:26,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:26,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2023-11-21 20:57:26,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:26,750 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 141 treesize of output 128 [2023-11-21 20:57:26,759 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 76 treesize of output 72 [2023-11-21 20:57:26,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:26,772 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 72 treesize of output 71 [2023-11-21 20:57:26,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:26,846 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 31 [2023-11-21 20:57:26,848 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:57:26,849 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:57:26,851 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 42 treesize of output 26 [2023-11-21 20:57:26,924 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-21 20:57:26,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552571946] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:26,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:26,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 23 [2023-11-21 20:57:26,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076315611] [2023-11-21 20:57:26,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:26,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-21 20:57:26,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:26,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-21 20:57:26,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=342, Unknown=19, NotChecked=82, Total=552 [2023-11-21 20:57:26,928 INFO L87 Difference]: Start difference. First operand 188 states and 217 transitions. Second operand has 24 states, 23 states have (on average 3.739130434782609) internal successors, (86), 24 states have internal predecessors, (86), 0 states have call successors, (0), 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-21 20:57:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:27,546 INFO L93 Difference]: Finished difference Result 218 states and 251 transitions. [2023-11-21 20:57:27,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 20:57:27,547 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.739130434782609) internal successors, (86), 24 states have internal predecessors, (86), 0 states have call successors, (0), 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 39 [2023-11-21 20:57:27,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:27,548 INFO L225 Difference]: With dead ends: 218 [2023-11-21 20:57:27,548 INFO L226 Difference]: Without dead ends: 218 [2023-11-21 20:57:27,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=376, Unknown=20, NotChecked=86, Total=600 [2023-11-21 20:57:27,549 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 210 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 378 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:27,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 739 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 773 Invalid, 0 Unknown, 378 Unchecked, 0.5s Time] [2023-11-21 20:57:27,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-11-21 20:57:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 206. [2023-11-21 20:57:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 173 states have (on average 1.3641618497109826) internal successors, (236), 204 states have internal predecessors, (236), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 244 transitions. [2023-11-21 20:57:27,556 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 244 transitions. Word has length 39 [2023-11-21 20:57:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:27,556 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 244 transitions. [2023-11-21 20:57:27,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.739130434782609) internal successors, (86), 24 states have internal predecessors, (86), 0 states have call successors, (0), 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-21 20:57:27,557 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 244 transitions. [2023-11-21 20:57:27,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-21 20:57:27,558 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:27,558 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] [2023-11-21 20:57:27,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:27,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-21 20:57:27,780 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:27,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:27,781 INFO L85 PathProgramCache]: Analyzing trace with hash -54763993, now seen corresponding path program 1 times [2023-11-21 20:57:27,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:27,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217405910] [2023-11-21 20:57:27,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:27,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:28,442 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-21 20:57:28,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:28,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217405910] [2023-11-21 20:57:28,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217405910] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:28,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920377179] [2023-11-21 20:57:28,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:28,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:28,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:28,446 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:28,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-21 20:57:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:28,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-21 20:57:28,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:28,631 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-21 20:57:28,665 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 20:57:28,666 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-21 20:57:28,672 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-21 20:57:28,706 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-21 20:57:28,712 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-21 20:57:28,813 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 20:57:28,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 20:57:28,823 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-21 20:57:28,876 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 20:57:28,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-21 20:57:28,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:57:28,888 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-21 20:57:28,917 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 20:57:28,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-21 20:57:28,925 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-21 20:57:29,103 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-21 20:57:29,107 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-21 20:57:29,141 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-21 20:57:29,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:29,335 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1183) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1182) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1183 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1183) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-11-21 20:57:29,358 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1183) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1182) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1183 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1183) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-11-21 20:57:29,373 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1179))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1178) .cse0 v_ArrVal_1183) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1182) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1178) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1179) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1183) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-11-21 20:57:29,389 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1178) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1179) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1183) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1179))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1178) .cse1 v_ArrVal_1183) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1182) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2023-11-21 20:57:29,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:29,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 36 treesize of output 37 [2023-11-21 20:57:29,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:29,406 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 30 treesize of output 31 [2023-11-21 20:57:29,410 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 54 treesize of output 46 [2023-11-21 20:57:29,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:29,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 100 treesize of output 99 [2023-11-21 20:57:29,430 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 60 treesize of output 52 [2023-11-21 20:57:29,435 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 76 treesize of output 70 [2023-11-21 20:57:29,441 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 48 treesize of output 46 [2023-11-21 20:57:29,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:29,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2023-11-21 20:57:29,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:29,511 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 65 treesize of output 50 [2023-11-21 20:57:29,516 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:57:29,517 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:57:29,519 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 74 treesize of output 50 [2023-11-21 20:57:29,524 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:57:29,526 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 42 treesize of output 30 [2023-11-21 20:57:29,536 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 20:57:29,664 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-21 20:57:29,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920377179] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:29,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:29,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 24 [2023-11-21 20:57:29,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754483175] [2023-11-21 20:57:29,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:29,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-21 20:57:29,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:29,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-21 20:57:29,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=358, Unknown=4, NotChecked=164, Total=600 [2023-11-21 20:57:29,668 INFO L87 Difference]: Start difference. First operand 206 states and 244 transitions. Second operand has 25 states, 24 states have (on average 4.75) internal successors, (114), 25 states have internal predecessors, (114), 0 states have call successors, (0), 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-21 20:57:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:30,625 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2023-11-21 20:57:30,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 20:57:30,626 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.75) internal successors, (114), 25 states have internal predecessors, (114), 0 states have call successors, (0), 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 39 [2023-11-21 20:57:30,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:30,627 INFO L225 Difference]: With dead ends: 215 [2023-11-21 20:57:30,627 INFO L226 Difference]: Without dead ends: 215 [2023-11-21 20:57:30,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=643, Unknown=4, NotChecked=228, Total=1056 [2023-11-21 20:57:30,629 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 713 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 748 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:30,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 549 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 679 Invalid, 0 Unknown, 748 Unchecked, 0.6s Time] [2023-11-21 20:57:30,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-21 20:57:30,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 206. [2023-11-21 20:57:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 173 states have (on average 1.3583815028901733) internal successors, (235), 204 states have internal predecessors, (235), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:30,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 243 transitions. [2023-11-21 20:57:30,639 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 243 transitions. Word has length 39 [2023-11-21 20:57:30,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:30,639 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 243 transitions. [2023-11-21 20:57:30,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.75) internal successors, (114), 25 states have internal predecessors, (114), 0 states have call successors, (0), 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-21 20:57:30,640 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 243 transitions. [2023-11-21 20:57:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-21 20:57:30,640 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:30,640 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] [2023-11-21 20:57:30,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:30,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-21 20:57:30,841 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:30,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:30,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1697681955, now seen corresponding path program 1 times [2023-11-21 20:57:30,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:30,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758525762] [2023-11-21 20:57:30,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:30,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:31,259 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-21 20:57:31,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:31,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758525762] [2023-11-21 20:57:31,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758525762] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:31,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861150783] [2023-11-21 20:57:31,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:31,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:31,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:31,262 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:31,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-21 20:57:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:31,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-21 20:57:31,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:31,449 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-21 20:57:31,478 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 20:57:31,478 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-21 20:57:31,489 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-21 20:57:31,496 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-21 20:57:31,574 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 20:57:31,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 41 treesize of output 38 [2023-11-21 20:57:31,579 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-21 20:57:31,590 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-21 20:57:31,599 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-21 20:57:31,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 20:57:31,667 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-21 20:57:31,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:31,838 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1284 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1284) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< .cse0 0) (= .cse0 0)))) is different from false [2023-11-21 20:57:31,860 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1284 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1284) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse0 0) (< .cse0 0)))) is different from false [2023-11-21 20:57:31,873 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1282 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1282) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1281) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1284) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< .cse0 0) (= .cse0 0)))) is different from false [2023-11-21 20:57:31,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:31,936 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 65 [2023-11-21 20:57:31,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:31,943 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 49 [2023-11-21 20:57:31,947 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 91 treesize of output 79 [2023-11-21 20:57:31,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:31,962 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 203 treesize of output 194 [2023-11-21 20:57:31,976 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 129 treesize of output 113 [2023-11-21 20:57:31,983 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 163 treesize of output 151 [2023-11-21 20:57:31,993 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 105 treesize of output 101 [2023-11-21 20:57:32,243 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-21 20:57:32,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861150783] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:32,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:32,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 23 [2023-11-21 20:57:32,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197049093] [2023-11-21 20:57:32,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:32,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-21 20:57:32,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:32,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-21 20:57:32,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=344, Unknown=11, NotChecked=120, Total=552 [2023-11-21 20:57:32,247 INFO L87 Difference]: Start difference. First operand 206 states and 243 transitions. Second operand has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 24 states have internal predecessors, (87), 0 states have call successors, (0), 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-21 20:57:32,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:32,977 INFO L93 Difference]: Finished difference Result 221 states and 254 transitions. [2023-11-21 20:57:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-21 20:57:32,978 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 24 states have internal predecessors, (87), 0 states have call successors, (0), 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 40 [2023-11-21 20:57:32,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:32,979 INFO L225 Difference]: With dead ends: 221 [2023-11-21 20:57:32,979 INFO L226 Difference]: Without dead ends: 221 [2023-11-21 20:57:32,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=705, Unknown=11, NotChecked=180, Total=1122 [2023-11-21 20:57:32,981 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 629 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 557 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:32,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 701 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 593 Invalid, 0 Unknown, 557 Unchecked, 0.5s Time] [2023-11-21 20:57:32,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-11-21 20:57:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 207. [2023-11-21 20:57:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 174 states have (on average 1.3563218390804597) internal successors, (236), 205 states have internal predecessors, (236), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 244 transitions. [2023-11-21 20:57:32,988 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 244 transitions. Word has length 40 [2023-11-21 20:57:32,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:32,988 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 244 transitions. [2023-11-21 20:57:32,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 24 states have internal predecessors, (87), 0 states have call successors, (0), 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-21 20:57:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 244 transitions. [2023-11-21 20:57:32,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-21 20:57:32,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:32,989 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:33,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:33,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-21 20:57:33,190 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:33,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:33,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1088532587, now seen corresponding path program 1 times [2023-11-21 20:57:33,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:33,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466943172] [2023-11-21 20:57:33,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:33,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:33,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:33,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466943172] [2023-11-21 20:57:33,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466943172] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:33,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809286003] [2023-11-21 20:57:33,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:33,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:33,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:33,666 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:33,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-21 20:57:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:33,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-21 20:57:33,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:33,854 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-21 20:57:33,883 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 20:57:33,883 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-21 20:57:33,905 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-21 20:57:33,989 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 20:57:33,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 20:57:34,035 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 20:57:34,035 INFO L378 Elim1Store]: Elim1 eliminated variable 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-21 20:57:34,060 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 20:57:34,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 20:57:34,192 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-21 20:57:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:34,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:34,289 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1384) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2023-11-21 20:57:34,333 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1382))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1384)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2023-11-21 20:57:34,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:34,385 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 36 treesize of output 29 [2023-11-21 20:57:34,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:34,398 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 136 treesize of output 123 [2023-11-21 20:57:34,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:34,418 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 80 treesize of output 78 [2023-11-21 20:57:34,425 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 70 treesize of output 66 [2023-11-21 20:57:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:34,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809286003] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:34,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:34,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 20 [2023-11-21 20:57:34,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345603343] [2023-11-21 20:57:34,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:34,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-21 20:57:34,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:34,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-21 20:57:34,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=263, Unknown=18, NotChecked=70, Total=420 [2023-11-21 20:57:34,647 INFO L87 Difference]: Start difference. First operand 207 states and 244 transitions. Second operand has 21 states, 20 states have (on average 4.2) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 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-21 20:57:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:35,483 INFO L93 Difference]: Finished difference Result 219 states and 252 transitions. [2023-11-21 20:57:35,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 20:57:35,484 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.2) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 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 41 [2023-11-21 20:57:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:35,486 INFO L225 Difference]: With dead ends: 219 [2023-11-21 20:57:35,486 INFO L226 Difference]: Without dead ends: 219 [2023-11-21 20:57:35,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=575, Unknown=18, NotChecked=106, Total=870 [2023-11-21 20:57:35,487 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 557 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 382 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:35,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 696 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 746 Invalid, 0 Unknown, 382 Unchecked, 0.6s Time] [2023-11-21 20:57:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-21 20:57:35,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2023-11-21 20:57:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 175 states have (on average 1.3542857142857143) internal successors, (237), 206 states have internal predecessors, (237), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 245 transitions. [2023-11-21 20:57:35,497 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 245 transitions. Word has length 41 [2023-11-21 20:57:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:35,497 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 245 transitions. [2023-11-21 20:57:35,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.2) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 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-21 20:57:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 245 transitions. [2023-11-21 20:57:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-21 20:57:35,498 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:35,499 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:35,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:35,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-21 20:57:35,714 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:35,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:35,714 INFO L85 PathProgramCache]: Analyzing trace with hash -546089323, now seen corresponding path program 1 times [2023-11-21 20:57:35,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:35,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084457360] [2023-11-21 20:57:35,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:35,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:35,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:35,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084457360] [2023-11-21 20:57:35,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084457360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:35,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:35,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 20:57:35,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992587803] [2023-11-21 20:57:35,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:35,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 20:57:35,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:35,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 20:57:35,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 20:57:35,810 INFO L87 Difference]: Start difference. First operand 208 states and 245 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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-21 20:57:35,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:35,892 INFO L93 Difference]: Finished difference Result 218 states and 245 transitions. [2023-11-21 20:57:35,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:57:35,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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-21 20:57:35,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:35,894 INFO L225 Difference]: With dead ends: 218 [2023-11-21 20:57:35,895 INFO L226 Difference]: Without dead ends: 218 [2023-11-21 20:57:35,895 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-21 20:57:35,896 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 37 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:35,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 306 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 20:57:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-11-21 20:57:35,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 202. [2023-11-21 20:57:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 169 states have (on average 1.3254437869822486) internal successors, (224), 200 states have internal predecessors, (224), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 232 transitions. [2023-11-21 20:57:35,909 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 232 transitions. Word has length 42 [2023-11-21 20:57:35,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:35,909 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 232 transitions. [2023-11-21 20:57:35,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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-21 20:57:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 232 transitions. [2023-11-21 20:57:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-21 20:57:35,911 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:35,911 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:35,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-21 20:57:35,911 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:35,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:35,913 INFO L85 PathProgramCache]: Analyzing trace with hash 615228639, now seen corresponding path program 1 times [2023-11-21 20:57:35,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:35,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635121315] [2023-11-21 20:57:35,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:35,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 20:57:35,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:35,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635121315] [2023-11-21 20:57:35,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635121315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:35,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:35,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:57:35,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075477110] [2023-11-21 20:57:35,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:35,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 20:57:35,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:35,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 20:57:35,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 20:57:35,986 INFO L87 Difference]: Start difference. First operand 202 states and 232 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 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-21 20:57:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:36,113 INFO L93 Difference]: Finished difference Result 207 states and 237 transitions. [2023-11-21 20:57:36,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:57:36,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 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 42 [2023-11-21 20:57:36,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:36,115 INFO L225 Difference]: With dead ends: 207 [2023-11-21 20:57:36,115 INFO L226 Difference]: Without dead ends: 207 [2023-11-21 20:57:36,116 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-21 20:57:36,116 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 150 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:36,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 124 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 20:57:36,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-11-21 20:57:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2023-11-21 20:57:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 164 states have (on average 1.329268292682927) internal successors, (218), 194 states have internal predecessors, (218), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 226 transitions. [2023-11-21 20:57:36,125 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 226 transitions. Word has length 42 [2023-11-21 20:57:36,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:36,126 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 226 transitions. [2023-11-21 20:57:36,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 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-21 20:57:36,126 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 226 transitions. [2023-11-21 20:57:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-21 20:57:36,127 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:36,127 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:36,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-21 20:57:36,127 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:36,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:36,128 INFO L85 PathProgramCache]: Analyzing trace with hash 182413883, now seen corresponding path program 1 times [2023-11-21 20:57:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:36,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673380662] [2023-11-21 20:57:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:36,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:36,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-21 20:57:36,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:36,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673380662] [2023-11-21 20:57:36,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673380662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:36,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:36,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:57:36,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230686636] [2023-11-21 20:57:36,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:36,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:36,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:36,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:36,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:36,197 INFO L87 Difference]: Start difference. First operand 196 states and 226 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-21 20:57:36,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:36,262 INFO L93 Difference]: Finished difference Result 248 states and 283 transitions. [2023-11-21 20:57:36,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:36,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 43 [2023-11-21 20:57:36,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:57:36,265 INFO L225 Difference]: With dead ends: 248 [2023-11-21 20:57:36,265 INFO L226 Difference]: Without dead ends: 248 [2023-11-21 20:57:36,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:36,266 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 52 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:57:36,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 223 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 20:57:36,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-21 20:57:36,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 215. [2023-11-21 20:57:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 183 states have (on average 1.3005464480874316) internal successors, (238), 213 states have internal predecessors, (238), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 246 transitions. [2023-11-21 20:57:36,274 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 246 transitions. Word has length 43 [2023-11-21 20:57:36,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:57:36,274 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 246 transitions. [2023-11-21 20:57:36,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-21 20:57:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 246 transitions. [2023-11-21 20:57:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-21 20:57:36,275 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:57:36,275 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:36,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-21 20:57:36,276 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-21 20:57:36,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:36,277 INFO L85 PathProgramCache]: Analyzing trace with hash 223488906, now seen corresponding path program 1 times [2023-11-21 20:57:36,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:36,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691502375] [2023-11-21 20:57:36,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:36,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:37,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:37,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:37,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691502375] [2023-11-21 20:57:37,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691502375] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:37,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511970557] [2023-11-21 20:57:37,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:37,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:37,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:37,060 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:37,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3f2f918-7fd1-4c76-9cb8-aaa3d66de886/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-21 20:57:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:37,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-21 20:57:37,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:37,266 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-21 20:57:37,297 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 20:57:37,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 11 treesize of output 11 [2023-11-21 20:57:37,326 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-21 20:57:37,336 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-21 20:57:37,416 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 20:57:37,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-21 20:57:37,422 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-21 20:57:37,484 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-21 20:57:37,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2023-11-21 20:57:37,508 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-21 20:57:37,509 INFO L378 Elim1Store]: Elim1 eliminated variable 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-21 20:57:37,610 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2023-11-21 20:57:37,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 58 [2023-11-21 20:57:37,620 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 46 treesize of output 25 [2023-11-21 20:57:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:37,996 INFO L327 TraceCheckSpWp]: Computing backward predicates...